Strategic Voting with Incomplete Information

Open Access
Authors
  • U. Endriss ORCID logo
  • S. Obraztsova
  • M. Polukarov
  • J.S. Rosenschein
Publication date 2016
Host editors
  • S. Kambhampati
Book title Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence
Book subtitle New York, NY, USA, 9-15 July, 2016
ISBN
  • 9781577357704
Event 25th International Joint Conference on Artificial Intelligence
Volume | Issue number 1
Pages (from-to) 236-242
Publisher Palo Alto, California: AAAI Press
Organisations
  • Faculty of Science (FNWI)
  • Interfacultary Research - Institute for Logic, Language and Computation (ILLC)
Abstract
Classical results in social choice theory on the susceptibility of voting rules to strategic manipulation make the assumption that the manipulator has complete information regarding the preferences of the other voters. In reality, however, voters only have incomplete information, which limits their ability to manipulate. We explore how these limitations affect both the manipulability of voting rules and the dynamics of systems in which voters may repeatedly update their own vote in reaction to the moves made by others. We focus on the Plurality, Veto, k-approval, Borda, Copeland, and Maximin voting rules, and consider several types of information that are natural in the context of these rules, namely information on the current front-runner, on the scores obtained by each alternative, and on the majority graph induced by the individual preferences.
Document type Conference contribution
Note Also presented at SCW-2016
Language English
Published at http://www.illc.uva.nl/~ulle/pubs/files/EndrissEtAlIJCAI2016.pdf https://www.ijcai.org/Abstract/16/041
Downloads
EndrissEtAlIJCAI2016 (Accepted author manuscript)
041 (Final published version)
Permalink to this page
Back