On the dimensionality of voting games

Proceedings of the National Conference on Artificial Intelligence

Volumn 1, Issue , 2008, Pages 69-74

  Elkind, Edith ^a   Goldberg, Leslie Ann ^b   Goldberg, Paul ^b   Wooldridge, Michael ^b  

^a UNIVERSITY OF SOUTHAMPTON   (United Kingdom)

^b UNIVERSITY OF LIVERPOOL   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; BIONICS; COMPUTATIONAL COMPLEXITY; VECTORS;

COMPLEXITY THEORIES; EFFICIENT ALGORITHMS; MINIMALITY; MONOTONICITY; TOTAL WEIGHTS; VOTING GAMES; WEIGHTED VOTING GAMES;

GAME THEORY;

EID: 57749187399     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (11)

1. Bartholdi, J. J.; Tovey, C. A.; and Trick, M. A. 1989. The computational difficulty of manipulating an election. Soc. Ch. and Welfare 6:227-241.
2. Bilbao, J. M.; Fernández, J. R.; Jiminéz, N.; and López, J. J. 2002. Voting power in the European Union enlargement. European Jnl of Oper. Res. 143:181-196.
3. Deineko, V. G., and Woeginger, G. 2006. On the dimension of simple monotonic games. European Jnl of Oper. Res. 170(1):315-318.
4. Deng, X., and Papadimitriou, C. H. 1994. On the complexity of cooperative solution concepts. Math. of Oper. Res. 19(2): 257-266.
5. Elkind, E.; Goldberg, L.; Goldberg, P.; and Wooldridge, M. 2007. Computational complexity of weighted threshold games. In Proc. AAAI-2007.
6. Endriss, U., and Lang, J., eds. 2006. Proc. COMSOC-2006.
7. Garey, M. R., and Johnson, D. S. 1979. Computers and Intractability. W H. Freeman.
8. Ieong, S., and Shoham, Y. 2005. Marginal contribution nets. In Proc. EC'05.
9. Muroga, S. 1971. Threshold Logic and its Applications. Wiley.
10. Taylor, A., and Zwicker, W. 1993. Weighted voting, multi-cameral representation, and power. Games and Econ. Beh. 5:170-181.
11. Taylor, A. D., and Zwicker, W. S. 1999. Simple Games. Princeton.