Computational complexity of weighted threshold games

Proceedings of the National Conference on Artificial Intelligence

Volumn 1, Issue , 2007, Pages 718-723

  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

APPROXIMATION ALGORITHMS; COMPUTATIONAL COMPLEXITY; POLYNOMIALS; PROBLEM SOLVING;

WEIGHTED THRESHOLD GAMES;

GAME THEORY;

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

References (14)

1. Ausiello, G.; Crescenzi, P.; Gambosi, G.; Kann, V.; Marchetti-Spaccamela, A.; and Protasi, M. 1999. Complexity and Approximation. Springer-Verlag: Berlin, Germany.
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 Journal of Operational Research 143:181-196.
3. Conitzer, V., and Sandholm, T. 2006. Complexity of constructing solutions in the core based on synergies among coalitions. Artificial Intelligence 170:607-619.
4. Deng, X., and Papadimitriou, C. H. 1994. On the complexity of cooperative solution concepts. Math. Oper. Res. 19(2):257-266.
5. Garey, M. R., and Johnson, D. S. 1990. Computers and Intractability; A Guide to the Theory of NP-Completeness. New York, NY, USA: W. H. Freeman & Co.
6. Ieong, S., and Shoham, Y. 2005. Marginal contribution nets: A compact representation scheme for coalitional games. In Proceedings of the Sixth ACM Conference on Electronic Commerce (EC'05).
7. Matsui, T., and Matsui, Y. 2000. A survey of algorithms for calculating power indices of weighted majority games. J. Oper. Res. Soc. Japan 43(1):71-86. New trends in mathematical programming (Kyoto, 1998).
8. Matsui, Y., and Matsui, T. 2001. NP-completeness for calculating power indices of weighted majority games. Theoret. Comput. Sci. 263(1-2):305-310. Combinatorics and computer science (Palaiseau, 1997).
9. Osborne, M. J., and Rubinstein, A. 1994. A Course in Game Theory. The MIT Press: Cambridge, MA.
10. Papadimitriou, C. H. 1994. Computational Complexity. Addison-Wesley: Reading, MA.
11. Peleg, B. 1968. On weights of constant-sum majority games. SIAM J. Appl. Math. 16:527-532.
12. Prasad, K., and Kelly, J. S. 1990. NP-completeness of some problems concerning voting games. Internat. J. Game Theory 19(1):1-9.
13. Schrijver, A. 2003. Combinatorial Optimization: Polyhedra and Efficiency. Springer.
14. Wolsey, L. A. 1976. The nucleolus and kernel for simple games or special valid inequalities for 0-1 linear integer programs. Internat. J. Game Theory 5(4):227-238.