Skip to Main content Skip to Navigation
Conference papers

Gibbard-Satterthwaite Games

Abstract : The Gibbard-Satterthwaite theorem implies the ubiquity of manipulators-voters who could change the election outcome in their favor by unilaterally modifying their vote. In this paper, we ask what happens if a given profile admits several such voters. We model strategic interactions among Gibbard-Satterthwaite manipulators as a normal-form game. We classify the 2-by-2 games that can arise in this setting for two simple voting rules, namely Plurality and Borda, and study the complexity of determining whether a given manipulative vote weakly dominates truth-telling, as well as existence of Nash equilibria.
Complete list of metadata

Cited literature [25 references]  Display  Hide  Download
Contributor : Open Archive Toulouse Archive Ouverte (OATAO) Connect in order to contact the contributor
Submitted on : Tuesday, May 16, 2017 - 4:41:41 PM
Last modification on : Wednesday, June 1, 2022 - 4:08:33 AM
Long-term archiving on: : Friday, August 18, 2017 - 12:23:14 AM


Files produced by the author(s)


  • HAL Id : hal-01523671, version 1
  • OATAO : 17001


Edith Elkind, Umberto Grandi, Francesca Rossi, Arkadii Slinko. Gibbard-Satterthwaite Games. 24th International Joint Conference on Artificial Intelligence (IJCAI 2015), Jul 2015, Buenos Aires, Argentina. pp. 533-539. ⟨hal-01523671⟩



Record views


Files downloads