An NTU Cooperative Game Theoretic View of Manipulating Elections

  • Michael Zuckerman
  • Piotr Faliszewski
  • Vincent Conitzer
  • Jeffrey S. Rosenschein
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7090)


Social choice theory and cooperative (coalitional) game theory have become important foundations for the design and analysis of multiagent systems. In this paper, we use cooperative game theory tools in order to explore the coalition formation process in the coalitional manipulation problem. Unlike earlier work on a cooperative-game-theoretic approach to the manipulation problem [2], we consider a model where utilities are not transferable. We investigate the issue of stability in coalitional manipulation voting games; we define two notions of the core in these domains, the α-core and the β-core. For each type of core, we investigate how hard it is to determine whether a given candidate is in the core. We prove that for both types of core, this determination is at least as hard as the coalitional manipulation problem. On the other hand, we show that for some voting rules, the α- and the β-core problems are no harder than the coalitional manipulation problem. We also show that some prominent voting rules, when applied to the truthful preferences of voters, may produce an outcome not in the core, even when the core is not empty.


Multiagent System Cooperative Game Vote Rule Condorcet Winner Strategic Vote 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Aumann, R.: Acceptable points in general cooperative n-person games. Contributions to the Theory of Games 4, 287–324 (1959)MathSciNetzbMATHGoogle Scholar
  2. 2.
    Bachrach, Y., Elkind, E., Faliszewski, P.: Coalitional voting manipulation: A game-theoretic perspective. In: The Twenty-Second International Joint Conference on Artificial Intelligence (IJCAI 2011), pp. 49–54 (2011)Google Scholar
  3. 3.
    Bartholdi, J., Orlin, J.: Single Transferable Vote resists strategic voting. Social Choice and Welfare 8, 341–354 (1991)MathSciNetzbMATHGoogle Scholar
  4. 4.
    Bartholdi, J., Tovey, C.A., Trick, M.A.: The computational difficulty of manipulating an election. Social Choice and Welfare 6, 227–241 (1989)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Conitzer, V., Sandholm, T., Lang, J.: When are elections with few candidates hard to manipulate? JACM 54(3) (June 2007)Google Scholar
  6. 6.
    Faliszewski, P., Hemaspaandra, E., Hemaspaandra, L.: How hard is bribery in elections? Journal of AI Research 35, 485–532 (2009)MathSciNetzbMATHGoogle Scholar
  7. 7.
    Faliszewski, P., Hemaspaandra, E., Hemaspaandra, L.: Using complexity to protect elections. Communications of the ACM 53(11), 74–82 (2010)CrossRefGoogle Scholar
  8. 8.
    Faliszewski, P., Procaccia, A.: AI’s war on manipulation: Are we winning? AI Magazine 31(4), 53–64 (2010)CrossRefGoogle Scholar
  9. 9.
    Gibbard, A.: Manipulation of voting schemes. Econometrica 41, 587–602 (1973)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Obraztsova, S., Elkind, E.: On the complexity of voting manipulation under randomized tie-breaking. In: The Twenty-Second International Joint Conference on Artificial Intelligence (IJCAI 2011), pp. 319–324 (2011)Google Scholar
  11. 11.
    Obraztsova, S., Elkind, E., Hazon, N.: Ties matter: Complexity of voting manipulation revisited. In: The Tenth International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2011), pp. 71–78 (2011)Google Scholar
  12. 12.
    Peleg, B., Sudholter, P.: Introduction to the Theory of Cooperative Games. Kluwer Academic Publishers, Boston (2003)CrossRefzbMATHGoogle Scholar
  13. 13.
    Satterthwaite, M.: Strategy-proofness and Arrow’s conditions: Existence and correspondence theorems for voting procedures and social welfare functions. Journal of Economic Theory 10, 187–217 (1975)MathSciNetCrossRefzbMATHGoogle Scholar
  14. 14.
    Xia, L., Conitzer, V., Procaccia, A.D.: A scheduling approach to coalitional manipulation. In: Proceedings of the 11th ACM Conference on Electronic Commerce (EC 2010), pp. 275–284 (2010)Google Scholar
  15. 15.
    Xia, L., Zuckerman, M., Procaccia, A.D., Conitzer, V., Rosenschein, J.S.: Complexity of unweighted coalitional manipulation under some common voting rules. In: The Twenty-First International Joint Conference on Artificial Intelligence (IJCAI 2009), Pasadena, California, pp. 348–353 (July 2009)Google Scholar
  16. 16.
    Zuckerman, M., Lev, O., Rosenschein, J.S.: An algorithm for the coalitional manipulation problem under maximin. In: The Tenth International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2011), Taipei, Taiwan, pp. 845–852 (2011)Google Scholar
  17. 17.
    Zuckerman, M., Procaccia, A.D., Rosenschein, J.S.: Algorithms for the coalitional manipulation problem. AI Journal 173(2), 392–412 (2009)MathSciNetzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Michael Zuckerman
    • 1
  • Piotr Faliszewski
    • 2
  • Vincent Conitzer
    • 3
  • Jeffrey S. Rosenschein
    • 1
  1. 1.School of Computer Science and EngineeringThe Hebrew Univ. of JerusalemIsrael
  2. 2.AGH University of Science and TechnologyKrakówPoland
  3. 3.Department of Computer ScienceDuke UniversityDurhamUSA

Personalised recommendations