Abstract
This paper studies power indices based on average representations of a weighted game. If restricted to account for the lack of power of null voters, average representations become coherent measures of voting power, with power distributions being proportional to the distribution of weights in the average representation. This makes these indices representation-compatible, a property not fulfilled by classical power indices. In this paper we introduce two computationally cheaper alternatives to the existing representation-compatible power indices, and study the properties of a family that now comprises four measures.
Similar content being viewed by others
Notes
See, Freixas and Pons (2010).
Note that any strongly monotonic and symmetric power index is type-revealing.
Each index was computed on a single Intel Xeon E5-2640v3 2.60Ghz core.
The total number of parliamentary seats according to the AWI is 184 not 183. This rounding error can be rectified by subtracting one seat from the largest party, as this would leave the power distribution unchanged according to AWI.
See, for example, the fixed-point iteration methods for obtaining the inverse solution for the Banzhaf index in Aziz et al. (2007).
Minimizing \(q+\sum _{i=1}^n w_i\) instead of \(\sum _{i=1}^n w_i\) makes no difference.
This notion of power is sometimes referred to as P-power (Felsenthal and Machover 2004).
References
Ansolabehere, S., Snyder, J. M., Strauss, A. B., & Ting, M. M. (2005). Voting weights and formateur advantages in the formation of coalition governments. American Journal of Political Science, 49, 550–563.
Aziz, H., Paterson, M., & Leech, D. (2007). Efficient algorithm for designing weighted voting games. Working Paper of the University of Warwick.
Baldoni, V., Berline, N., De Loera, J. A., Dutra, B., Köppe, M., Moreinis, S., et al. (2014). A user’s guide for LattE integrale v1.7.2. https://www.math.ucdavis.edu/~latte/.
Bilbao, J. M., Fernández, J. R., Losada, A. J., & López, J. J. (2000). Generating functions for computing power indices efficiently. TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, 8, 191–213.
Brams, S. J. (1990). Negotiation games: Applying game theory to bargaining and arbitration. Abingdon: Routledge.
Carreras, F., & Freixas, J. (1996). Complete simple games. Mathematical Social Sciences, 32, 139–155.
Chalkiadakis, G., Elkind, E., & Wooldridge, M. (2011). Computational aspects of cooperative game theory (Synthesis lectures on artificial intelligence and machine learning). San Rafael: Morgan & Claypool Publishers.
Crama, Y., & Hammer, P. L. (2011). Boolean functions: Theory, algorithms, and applications. Cambridge: Cambridge University Press.
De Loera, J. A., Dutra, B., Köppe, M., Moreinis, S., Pinto, G., & Wu, J. (2013). Software for exact integration of polynomials over polyhedra. Computational Geometry: Theory and Applications, 46, 232–252.
Dubey, P., & Shapley, L. S. (1979). Mathematical properties of the Banzhaf power index. Mathematics of Operations Research, 4, 99–131.
Einy, E., & Lehrer, E. (1989). Regular simple games. International Journal of Game Theory, 18, 195–207.
Felsenthal, D. S., & Machover, M. (1998). The measurement of voting power: Theory and practice, problems and paradoxes. Cheltenham: Edward Elgar.
Felsenthal, D. S., & Machover, M. (2004). A priori voting power: What is it all about? Political Studies Review, 2, 1–23.
Felsenthal, D. S., & Machover, M. (2005). Voting power measurement: A story of misreinvention. Social Choice and Welfare, 25, 485–506.
Freixas, J., & Gambarelli, G. (1997). Common internal properties among power indices. Control and Cybernetics, 26, 591–604.
Freixas, J., & Kaniovski, S. (2014). The minimum sum representation as an index of voting power. European Journal of Operational Research, 233, 739–748.
Freixas, J., & Kurz, S. (2014). On minimum integer representations of weighted games. Mathematical Social Sciences, 67, 9–22.
Freixas, J., & Molinero, X. (2009). On the existence of a minimum integer representation for weighted voting systems. Annals of Operations Research, 166, 243–260.
Freixas, J., & Molinero, X. (2010). Detection of paradoxes of power indices for simple games. In L. A. Petrosjan & N. A. Zenkevich (Eds.), Contributions to Game Theory and Management (pp. 82–90). Saint Petersburg: Graduate School of Management, Saint Petersburg State University.
Freixas, J., & Pons, M. (2010). Hierarchies achievable in simple games. Theory and Decision, 68, 393–404.
Houy, N., & Zwicker, W. S. (2014). The geometry of voting power: Weighted voting and hyper-ellipsoids. Games and Economic Behavior, 84, 7–16.
Isbell, J. R. (1956). A class of majority games. Quarterly Journal of Mechanics and Applied Mathematics, 7, 183–187.
Kaniovski, S., & Kurz, S. (2015). The average representation—A cornucopia of power indices? Homo Oeconomicus, 32, 169–182.
Kurz, S. (2012). On minimum sum representations for weighted voting games. Annals of Operations Research, 196, 361–369.
Kurz, S., Napel, S., & Nohn, A. (2014). The nucleolus of large majority games. Economics Letters, 123, 139–143.
Taylor, A. D., & Pacelli, A. M. (2008). Mathematics and politics: Strategy, voting, power, and proof. Berlin: Springer.
Taylor, A. D., & Zwicker, W. S. (1999). Simple games: Desirability relations, trading, and pseudoweightings. Princeton, NJ: Princeton University Press.
Acknowledgements
We are greatly indebted to three anonymous reviewers, whose critique considerably improved the quality of this paper. We would also like to thank the participants of the 27th European Conference on Operational Research in 2015 and the annual conference of the German Operations Research Society (GOR) in 2015 for their comments and suggestions.
Author information
Authors and Affiliations
Corresponding author
Appendix
Appendix
1.1 Example \(\left[ 3;2,1,1\right] \)
The sets of minimal winning and maximal losing coalitions for the game \(\left[ 3;2,1,1\right] \) are, respectively, \(\{\{1,2\},\{1,3\},\{2,3\}\}\) and \(\{\{1\},\{2,3\}\}\). Since voters 2 and 3 are equivalent, there are two equivalence classes in this game. There are no nulls.
Using Lemma 2, we obtain the following constraints:
In addition, \(w_1,w_2,w_3\ge 0\) and \(w_1+w_2+w_3=1\). Eliminating \(w_3\) and removing the redundant constraints yields the following inequalities: \(w_2>0\), \(w_2<1-w_1\), \(w_2>1-2w_1\), \(w_2<w_1\). Since \(1-2w_1<w_1\) and \(1-w_1>0\), we have \(w_1\in \big (\frac{1}{3},1\big )\). For \(w_1\in \big (\frac{1}{3},\frac{1}{2}\big )\), we have \(w_2\in \big (1-2w_1,w_1\big )\). For \(w_1\in \big [\frac{1}{2},1\big )\), we have \(w_2\in \big (0,1-w_1\big )\). The polytope is thus given by
Since there are no nulls in this game, the null-revealing polytope \(\mathsf {V}^d(v)\) coincides with its non-revealing counterpart \(\mathsf {V}(v)\).
For voter 1, we have
For voter 2, we obtain
The total volume of the polytope is given by
This yields the following vector of average (normalized) feasible weights \(\left( \frac{11}{18},\frac{7}{36},\frac{7}{36}\right) \).
The polytope for the average representation defined by Lemma 3 is given by
since need to take into account the inequalities from the minimal winning and the maximal losing coalitions only, due to \(w_1,w_2\ge 0\) and \(w_3=1-w_1-w_2\ge 1-w_2-q\ge 0\). From \(w_1\le q\) and \(1-w_1\le q\) follows \(\frac{1}{2}\le q\le 1\). We can rewrite the four inequalities to \(1-q\le w_1\le q\), with \(1-q\le q\) for all \(q\ge \frac{1}{2}\), and \(q-w_1\le w_2\le 1-q\), with \(q-w_1\le 1-q\) iff \(w_1\ge 2q-1\). Since \(2q-1\ge 1-q\) iff \(q\ge \frac{2}{3}\) and \(2q-1\le q\) for all \(q\le 1\), we have,
so that the average representation is given by \(\left( \frac{7}{12},\frac{5}{24},\frac{5}{24}\right) \).
We now move from individual voting weights to weights aggregated by equivalence classes, as if voters belonging to the same class form a voting bloc with weight being equal to the sum of weights of its members.
The game has two classes: class A comprises voter 1, whereas voters 2 and 3 form class B. Let \(w_a\) be the voting weight of class A, which equals the weight of the first voter \(w_a=w_1\). The AWTI polytope degenerates to an interval \( \mathsf {V}^t(v)=\left\{ w_a\in \mathbb {R}_{\ge 0}\mid 3w_a\ge 1, w_a\le 1\right\} . \) We have,
The voting power of class A according to AWTI equals \(\frac{2}{3}\), which is the power of the first voter. The power of class B equals \(\frac{1}{3}\). Since all voters comprising a class share its power equally, the AWTI power vector for the voters reads \(\left( \frac{2}{3},\frac{1}{6},\frac{1}{6}\right) \).
We now turn to the final index. The ARTI polytope is given by
where \(w_a\) is the voting weight of class A. We have,
The power distribution according to the ARTI is \(\left( \frac{11}{18},\frac{7}{36},\frac{7}{36}\right) \) (Fig. 1; Tables 9, 10, 11, 12).
Rights and permissions
About this article
Cite this article
Kaniovski, S., Kurz, S. Representation-compatible power indices. Ann Oper Res 264, 235–265 (2018). https://doi.org/10.1007/s10479-017-2672-3
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-017-2672-3