Simple games cover voting systems in which a single alternative, such as a bill or an amendment, is pitted against the status quo. A simple game or a yes-no voting system is a set of rules that specifies exactly which collections of “yea” votes yield passage of the issue at hand. Each of these collections of “yea” voters forms a winning coalition. We are interested in performing a complexity analysis on problems defined on such families of games. This analysis as usual depends on the game representation used as input. We consider four natural explicit representations: winning, losing, minimal winning, and maximal losing. We first analyze the complexity of testing whether a game is simple and testing whether a game is weighted. We show that, for the four types of representations, both problems can be solved in polynomial time. Finally, we provide results on the complexity of testing whether a simple game or a weighted game is of a special type. We analyze strongness, properness, weightedness, homogeneousness, decisiveness and majorityness, which are desirable properties to be fulfilled for a simple game. Finally, we consider the possibility of representing a game in a more succinct and natural way and show that the corresponding recognition problem is hard.
Keywords: simple, weighted, majority games, NP-completeness
@article{RO_2011__45_4_295_0,
author = {Freixas, Josep and Molinero, Xavier and Olsen, Martin and Serna, Maria},
title = {On the complexity of problems on simple games},
journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
pages = {295--314},
year = {2011},
publisher = {EDP Sciences},
volume = {45},
number = {4},
doi = {10.1051/ro/2011115},
mrnumber = {2881357},
zbl = {1235.68082},
language = {en},
url = {https://www.numdam.org/articles/10.1051/ro/2011115/}
}
TY - JOUR AU - Freixas, Josep AU - Molinero, Xavier AU - Olsen, Martin AU - Serna, Maria TI - On the complexity of problems on simple games JO - RAIRO - Operations Research - Recherche Opérationnelle PY - 2011 SP - 295 EP - 314 VL - 45 IS - 4 PB - EDP Sciences UR - https://www.numdam.org/articles/10.1051/ro/2011115/ DO - 10.1051/ro/2011115 LA - en ID - RO_2011__45_4_295_0 ER -
%0 Journal Article %A Freixas, Josep %A Molinero, Xavier %A Olsen, Martin %A Serna, Maria %T On the complexity of problems on simple games %J RAIRO - Operations Research - Recherche Opérationnelle %D 2011 %P 295-314 %V 45 %N 4 %I EDP Sciences %U https://www.numdam.org/articles/10.1051/ro/2011115/ %R 10.1051/ro/2011115 %G en %F RO_2011__45_4_295_0
Freixas, Josep; Molinero, Xavier; Olsen, Martin; Serna, Maria. On the complexity of problems on simple games. RAIRO - Operations Research - Recherche Opérationnelle, Tome 45 (2011) no. 4, pp. 295-314. doi: 10.1051/ro/2011115
[1] and , Complete simple games. Math. Soc. Sci. 32 (1996) 139-155. | Zbl | MR
[2] and , On the dimension of simple monotonic games. Eur. J. Oper. Res. 170 (2006) 315-318. | Zbl
[3] and , On the complexity of cooperative solution concepts. Math. Oper. Res. 19 (1994) 257-266. | Zbl | MR
[4] and , Computing the nucleolus of weighted voting games, in SODA '09 : Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics. Philadelphia, PA, USA (2009) 327-335. | MR
[5] , , and , Computational complexity of weighted threshold games, in Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence. Vancouver, British Columbia, Canada (2007) 718-723.
[6] , , and , On the dimensionality of voting games, in Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence. Hyatt Regency McCormick Place, Chicago (2008) 69-74.
[7] and , Simple games and weighted games : A theoretical and computational viewpoint. Discrete Appl. Math. 157 (2009) 1496-1508. | Zbl | MR
[8] and , Weighted voting, abstention, and multiple levels of approval. Soc. Choice Welfare 21 (2003) 399-431. | Zbl | MR
[9] and , Computers and Intractability : A Guide to the Theory of NP-Completness, edited by W.H. Freeman. San Francisco, New York, USA (1979). | Zbl | MR
[10] and , Voting games and computational complexity. Oxford Econ. Papers 60 2008 546-565.
[11] and , On the geometric separability of Boolean functions. Discrete Appl. Math. 66 (1996) 205-218. | Zbl | MR
[12] , A new polynomial-time algorithm for linear programming. Combinatorica 4 (1984) 373-395. | Zbl
[13] , A polynomial algorithm for linear programming. Dokl. Akad. Nauk. SSSR 244 (1979) 1093-1096; English translation Soviet Math. Dokl. 20 (1979) 191-194. | Zbl | MR
[14] and , NP-completeness for calculating power indices of weighted majority games. Theor. Comput. Sci. 263 (2001) 305-310. | Zbl | MR
[15] and , Decision tree approximations of Boolean functions. Theor. Comput. Sci. 270 (2002) 609-623. | Zbl | MR
[16] , Game Theory, 3th edition. Academic Press, San Diego, USA (1995). | Zbl | MR
[17] , Computational Complexity. Addison Wesley (1994). | Zbl | MR
[18] and , Polynomial-time algorithms for regular set-covering and threshold synthesis. Discrete Appl. Math. 12 (1985) 57-69. | Zbl | MR
[19] and , NP-completeness of some problems concerning voting games. Int. J. Game Theory 19 (1990) 1-9. | Zbl | MR
[20] , An algorithm for the construction of homogeneous games, in Ökonomie und Mathematik, edited by O. Opitz and B. Rauhut. Springer-Verlag (1987) 63-74. | Zbl
[21] and , Simple games and magic squares. J. Comb. Theory, Ser. A 71 (1995) 67-68. | Zbl | MR
[22] and , Simple games : desirability relations, trading, and pseudoweightings. Princeton University Press, New Jersey, USA (1999). | Zbl | MR
[23] and , Theory of Games and Economic Behavior. Princeton University Press, Princeton, New Jersey, USA (1944). | Zbl | MR
Cité par Sources :
