The Manipulability of Voting Systems
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 2182815
- Strategic manipulability without resoluteness or shared beliefs: Gibbard-Satterthwaite generalized
- scientific article; zbMATH DE number 3898540
- The geometry of manipulation -- a quantitative proof of the Gibbard-Satterthwaite theorem
- Gibbard-Satterthwaite games for k-approval voting rules
Cited in
(15)- Merging epistemic states and manipulation
- On the equivalence of the HEX game theorem and the Duggan-Schwartz theorem for strategy-proof social choice correspondences
- Manipulability of consular election rules
- scientific article; zbMATH DE number 5816544 (Why is no real title available?)
- A geometric look at manipulation
- Reflections on vote manipulation
- Knowledge, Games and Tales from the East
- Comparing generalized median voter schemes according to their manipulability
- Taxonomy of powerful voters and manipulation in the framework of social choice functions
- Sensitivity analyses and measurements for group decisions using weighted scoring rules
- On manipulation in merging epistemic states
- A comment on the Gibbard-Satterthwaite theorem
- Data aggregation and Simpson's paradox gauged by index numbers
- An extension of the Moulin no show paradox for voting correspondences
- Consistent voting systems with a continuum of voters
This page was built for publication: The Manipulability of Voting Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4417723)
