Skip to main content
Log in

Representation-compatible power indices

  • Original Paper
  • Published:
Annals of Operations Research Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Notes

  1. We could minimize the total sum of integral voting weights to obtain a unique representation for \(n\le 7\), as in Freixas and Molinero (2009), or Freixas and Kurz (2014). For other options, see Application 9.9 in Crama and Hammer (2011).

  2. See, Taylor and Zwicker (1999). For a survey, see Chapter 9.8 in Crama and Hammer (2011).

  3. See, Freixas and Pons (2010).

  4. Note that any strongly monotonic and symmetric power index is type-revealing.

  5. Each index was computed on a single Intel Xeon E5-2640v3 2.60Ghz core.

  6. 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.

  7. See, for example, the fixed-point iteration methods for obtaining the inverse solution for the Banzhaf index in Aziz et al. (2007).

  8. Minimizing \(q+\sum _{i=1}^n w_i\) instead of \(\sum _{i=1}^n w_i\) makes no difference.

  9. 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.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • Brams, S. J. (1990). Negotiation games: Applying game theory to bargaining and arbitration. Abingdon: Routledge.

    Book  Google Scholar 

  • Carreras, F., & Freixas, J. (1996). Complete simple games. Mathematical Social Sciences, 32, 139–155.

    Article  Google Scholar 

  • 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.

    Google Scholar 

  • Crama, Y., & Hammer, P. L. (2011). Boolean functions: Theory, algorithms, and applications. Cambridge: Cambridge University Press.

    Book  Google Scholar 

  • 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.

    Article  Google Scholar 

  • Dubey, P., & Shapley, L. S. (1979). Mathematical properties of the Banzhaf power index. Mathematics of Operations Research, 4, 99–131.

    Article  Google Scholar 

  • Einy, E., & Lehrer, E. (1989). Regular simple games. International Journal of Game Theory, 18, 195–207.

    Article  Google Scholar 

  • Felsenthal, D. S., & Machover, M. (1998). The measurement of voting power: Theory and practice, problems and paradoxes. Cheltenham: Edward Elgar.

    Book  Google Scholar 

  • Felsenthal, D. S., & Machover, M. (2004). A priori voting power: What is it all about? Political Studies Review, 2, 1–23.

    Article  Google Scholar 

  • Felsenthal, D. S., & Machover, M. (2005). Voting power measurement: A story of misreinvention. Social Choice and Welfare, 25, 485–506.

    Article  Google Scholar 

  • Freixas, J., & Gambarelli, G. (1997). Common internal properties among power indices. Control and Cybernetics, 26, 591–604.

    Google Scholar 

  • Freixas, J., & Kaniovski, S. (2014). The minimum sum representation as an index of voting power. European Journal of Operational Research, 233, 739–748.

    Article  Google Scholar 

  • Freixas, J., & Kurz, S. (2014). On minimum integer representations of weighted games. Mathematical Social Sciences, 67, 9–22.

    Article  Google Scholar 

  • Freixas, J., & Molinero, X. (2009). On the existence of a minimum integer representation for weighted voting systems. Annals of Operations Research, 166, 243–260.

    Article  Google Scholar 

  • 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.

    Google Scholar 

  • Freixas, J., & Pons, M. (2010). Hierarchies achievable in simple games. Theory and Decision, 68, 393–404.

    Article  Google Scholar 

  • Houy, N., & Zwicker, W. S. (2014). The geometry of voting power: Weighted voting and hyper-ellipsoids. Games and Economic Behavior, 84, 7–16.

    Article  Google Scholar 

  • Isbell, J. R. (1956). A class of majority games. Quarterly Journal of Mechanics and Applied Mathematics, 7, 183–187.

    Google Scholar 

  • Kaniovski, S., & Kurz, S. (2015). The average representation—A cornucopia of power indices? Homo Oeconomicus, 32, 169–182.

    Google Scholar 

  • Kurz, S. (2012). On minimum sum representations for weighted voting games. Annals of Operations Research, 196, 361–369.

    Article  Google Scholar 

  • Kurz, S., Napel, S., & Nohn, A. (2014). The nucleolus of large majority games. Economics Letters, 123, 139–143.

    Article  Google Scholar 

  • Taylor, A. D., & Pacelli, A. M. (2008). Mathematics and politics: Strategy, voting, power, and proof. Berlin: Springer.

    Book  Google Scholar 

  • Taylor, A. D., & Zwicker, W. S. (1999). Simple games: Desirability relations, trading, and pseudoweightings. Princeton, NJ: Princeton University Press.

    Google Scholar 

Download references

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

Authors

Corresponding author

Correspondence to Serguei Kaniovski.

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:

$$\begin{aligned} w_1+w_2>w_1\Longleftrightarrow & {} w_2>0;\\ w_1+w_3>w_1\Longleftrightarrow & {} w_3>0;\\ w_1+w_2>w_2+w_3\Longleftrightarrow & {} w_1>w_3;\\ w_1+w_3>w_2+w_3\Longleftrightarrow & {} w_1>w_2. \end{aligned}$$

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

$$\begin{aligned} \mathsf {V}^d(v)=\left\{ (w_1,w_2)\in \mathbb {R}^2_{\ge 0}\mid w_2\ge 0, w_2\le 1-w_1, w_2\ge 1-2w_1, w_2\le w_1\right\} . \end{aligned}$$

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

$$\begin{aligned} \iint \limits _{\mathsf {V}^d} w_1{\text {d}}w_1{\text {d}}w_2= & {} \int _{\frac{1}{3}}^{\frac{1}{2}}\int _{1-2w_1}^{w_1} w_1{\text {d}}w_2{\text {d}}w_1+\int _{\frac{1}{2}}^{1}\int _{0}^{1-w_1} w_1{\text {d}}w_2{\text {d}}w_1\\= & {} \frac{1}{54}+\frac{1}{12}=\frac{11}{108}. \end{aligned}$$

For voter 2, we obtain

$$\begin{aligned} \iint \limits _{\mathsf {V}^d} w_2{\text {d}}w_1{\text {d}}w_2= & {} \int _{\frac{1}{3}}^{\frac{1}{2}}\int _{1-2w_1}^{w_1} w_2{\text {d}}w_1{\text {d}}w_2+\int _{\frac{1}{2}}^{1}{\text {d}}w_1\int _{0}^{1-w_1} w_2{\text {d}}w_2{\text {d}}w_1\\= & {} \frac{1}{48}+\frac{5}{432}=\frac{7}{216}. \end{aligned}$$

The total volume of the polytope is given by

$$\begin{aligned} \iint \limits _{\mathsf {V}^d}{\text {d}}w_1{\text {d}}w_2=\int _{\frac{1}{3}}^{\frac{1}{2}}\int _{1-2w_1}^{w_1}{\text {d}}w_2{\text {d}}w_1+\int _{\frac{1}{2}}^{1}\int _{0}^{1-w_1}{\text {d}}w_2{\text {d}}w_1=\frac{1}{8}+\frac{1}{24}=\frac{1}{6}, \end{aligned}$$

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

$$\begin{aligned} \mathsf {R}^d(v)=\left\{ (q,w_1,w_2)\in \mathbb {R}^3_{\ge 0}\mid w_1+w_2\ge q,w_1\le q,1-w_1\le q,1-w_2\ge q\right\} , \end{aligned}$$

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,

$$\begin{aligned} \iint \limits _{\mathsf {R}^d} w_1{\text {d}}w_1{\text {d}}w_2{\text {d}}q= & {} \int _{\frac{1}{2}}^{\frac{2}{3}}{\text {d}}q\int _{1-q}^{q}w_1{\text {d}}w_1\int _{q-w_1}^{1-q}{\text {d}}w_2\\&+\,\int _{\frac{2}{3}}^{1}{\text {d}}q\int _{2q-1}^{q}w_1{\text {d}}w_1\int _{q-w_1}^{1-q}{\text {d}}w_2 = \frac{31}{7776}+\frac{1}{243}=\frac{7}{864}\\ \iint \limits _{\mathsf {R}^d} w_2{\text {d}}w_1{\text {d}}w_2{\text {d}}q= & {} \int _{\frac{1}{2}}^{\frac{2}{3}}{\text {d}}q\int _{1-q}^{q}{\text {d}}w_1\int _{q-w_1}^{1-q}w_2{\text {d}}w_2\\&+\,\int _{\frac{2}{3}}^{1}{\text {d}}q\int _{2q-1}^{q}{\text {d}}w_1\int _{q-w_1}^{1-q}w_2{\text {d}}w_2 = \frac{29}{15{,}552}+\frac{1}{972}=\frac{5}{1728},\\ \iint \limits _{\mathsf {R}^d}{\text {d}}w_1{\text {d}}w_2{\text {d}}q= & {} \int _{\frac{1}{2}}^{\frac{2}{3}}{\text {d}}q\int _{1-q}^{q}{\text {d}}w_1\int _{q-w_1}^{1-q}{\text {d}}w_2+\int _{\frac{2}{3}}^{1}{\text {d}}q\int _{2q-1}^{q}{\text {d}}w_1\int _{q-w_1}^{1-q}{\text {d}}w_2\\= & {} \frac{5}{648}+\frac{1}{162}=\frac{1}{72}, \end{aligned}$$

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,

$$\begin{aligned} \int \limits _{\mathsf {V}^t} w_a{\text {d}}w_a=\int _{\frac{1}{3}}^1 w_a{\text {d}}w_a=\frac{4}{9}\quad \text{ and }\quad \int \limits _{\mathsf {V}^t} {\text {d}}w_a=\int _{\frac{1}{3}}^1 {\text {d}}w_a=\frac{2}{3}. \end{aligned}$$

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

$$\begin{aligned} \mathsf {R}^t(v)=\left\{ (q,w_a)\in \mathbb {R}_{\ge 0}^2\mid 3w_a\ge 1, 2q\le 1+w_a, q\ge 1-w_a, q\ge w_a\right\} , \end{aligned}$$

where \(w_a\) is the voting weight of class A. We have,

$$\begin{aligned} \iint \limits _{\mathsf {R}^t} w_a{\text {d}}w_a{\text {d}}q= & {} \int _{\frac{1}{3}}^{\frac{1}{2}}w_a{\text {d}}w_a\int _{1-w_a}^{\frac{1+w_a}{2}}{\text {d}}q+\int _{\frac{1}{2}}^{1}w_a{\text {d}}w_a\int _{w_a}^{\frac{1+w_a}{2}}{\text {d}}q=\frac{1}{108}+\frac{1}{24}=\frac{11}{216},\\ \iint \limits _{\mathsf {R}^t} {\text {d}}w_a{\text {d}}q= & {} \int _{\frac{1}{3}}^{\frac{1}{2}}{\text {d}}w_a\int _{1-w_a}^{\frac{1+w_a}{2}}{\text {d}}q+\int _{\frac{1}{2}}^{1}{\text {d}}w_a\int _{w_a}^{\frac{1+w_a}{2}}{\text {d}}q=\frac{1}{48}+\frac{1}{16}=\frac{1}{12}. \end{aligned}$$

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).

Fig. 1
figure 1

The distribution of Euclidean distances between the indices

Table 9 Representation-compatible power indices for \(n\le 5\)
Table 10 Representation-compatible power indices for \(n\le 5\) (cont.)
Table 11 Representation-compatible power indices for \(n\le 5\) (cont.)
Table 12 Representation-compatible power indices for \(n\le 5\) (cont.)

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

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

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-017-2672-3

Keywords

Mathematics Subject Classification

Navigation