Nonexistence of Voting Rules That Are Usually Hard to Manipulate

@inproceedings{Conitzer2006NonexistenceOV,
  title={Nonexistence of Voting Rules That Are Usually Hard to Manipulate},
  author={Vincent Conitzer and Tuomas Sandholm},
  booktitle={AAAI},
  year={2006}
}
Aggregating the preferences of self-interested agents is a key problem for multiagent systems, and one general method for doing so is to vote over the alternatives (candidates). Unfortunately, the Gibbard-Satterthwaite theorem shows that when there are three or more candidates, all reasonable voting rules are manipulable (in the sense that there exist situations in which a voter would benefit from reporting its preferences insincerely). To circumvent this impossibility result, recent research… CONTINUE READING
Highly Cited
This paper has 139 citations. REVIEW CITATIONS

Citations

Publications citing this paper.

139 Citations

02040'07'10'13'16'19
Citations per Year
Semantic Scholar estimates that this publication has 139 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…