Threshold strategy-proofness: on manipulability in large voting problems (Q1886747)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Threshold strategy-proofness: on manipulability in large voting problems |
scientific article; zbMATH DE number 2116811
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Threshold strategy-proofness: on manipulability in large voting problems |
scientific article; zbMATH DE number 2116811 |
Statements
Threshold strategy-proofness: on manipulability in large voting problems (English)
0 references
19 November 2004
0 references
Mean rule
0 references
0.8755313
0 references
0.8733432
0 references
0.8716626
0 references
0.87069035
0 references
0.86748374
0 references
0.86489403
0 references
0.8638962
0 references
0.8595153
0 references
0.8590354
0 references
