IDEAS home Printed from https://ideas.repec.org/a/spr/topjnl/v22y2014i2p658-673.html
   My bibliography  Save this article

A generating functions approach for computing the Public Good index efficiently

Author

Listed:
  • Michela Chessa

Abstract

In the past years, a combinatorial method based on generating functions was introduced to compute Shapley–Shubik, Banzhaf and other indices for weighted majority games exactly and efficiently. In this paper, taking inspiration from what has already been done, in view of the efficiency of the generating functions method, we define a generating function for computing the Public Good index, maintaining the property of exactness of the resulting algorithm. The main difference with the existing algorithms derives from the fact that the Public Good index takes into account only minimal winning coalitions and counts how many swings of a player involve them. Moreover, we study the computational complexity of the algorithm and we evaluate the Public Good index for the vote share of the Russian Duma in 1995. Copyright Sociedad de Estadística e Investigación Operativa 2014

Suggested Citation

  • Michela Chessa, 2014. "A generating functions approach for computing the Public Good index efficiently," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 22(2), pages 658-673, July.
    • Handle: RePEc:spr:topjnl:v:22:y:2014:i:2:p:658-673
    DOI: 10.1007/s11750-013-0286-8
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s11750-013-0286-8
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s11750-013-0286-8?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Steven J. Brams & Peter C. Fishburn, 1996. "Minimal winning coalitions in weighted-majority voting games," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 13(4), pages 397-417.
    2. Roger B. Myerson, 1977. "Graphs and Cooperation in Games," Mathematics of Operations Research, INFORMS, vol. 2(3), pages 225-229, August.
    3. Algaba, E. & Bilbao, J.M. & Fernandez, J.R., 2007. "The distribution of power in the European Constitution," European Journal of Operational Research, Elsevier, vol. 176(3), pages 1752-1766, February.
    4. Steven J. Brams & Peter C. Fishburn, 1995. "When is Size a Liability?," Journal of Theoretical Politics, , vol. 7(3), pages 301-316, July.
    5. Alonso-Meijide, J.M. & Bilbao, J.M. & Casas-Méndez, B. & Fernández, J.R., 2009. "Weighted multiple majority games with unions: Generating functions and applications to the European Union," European Journal of Operational Research, Elsevier, vol. 198(2), pages 530-544, October.
    6. J.R. Fernández & E. Algaba & J.M. Bilbao & A. Jiménez & N. Jiménez & J.J. López, 2002. "Generating Functions for Computing the Myerson Value," Annals of Operations Research, Springer, vol. 109(1), pages 143-158, January.
    7. Edward Packel & John Deegan, 1980. "An axiomated family of power indices for simple n-person games," Public Choice, Springer, vol. 35(2), pages 229-239, January.
    8. J. Alonso-Meijide & C. Bowles, 2005. "Generating Functions for Coalitional Power Indices: An Application to the IMF," Annals of Operations Research, Springer, vol. 137(1), pages 21-44, July.
    9. Dennis Leech, 2003. "Computing Power Indices for Large Voting Games," Management Science, INFORMS, vol. 49(6), pages 831-837, June.
    10. Algaba, E. & Bilbao, J. M. & Fernandez Garcia, J. R. & Lopez, J. J., 2003. "Computing power indices in weighted multiple majority games," Mathematical Social Sciences, Elsevier, vol. 46(1), pages 63-80, August.
    11. Shapley, L. S. & Shubik, Martin, 1954. "A Method for Evaluating the Distribution of Power in a Committee System," American Political Science Review, Cambridge University Press, vol. 48(3), pages 787-792, September.
    12. Guillermo Owen, 1972. "Multilinear Extensions of Games," Management Science, INFORMS, vol. 18(5-Part-2), pages 64-79, January.
    13. J. Bilbao & J. Fernández & A. Losada & J. López, 2000. "Generating functions for computing power indices efficiently," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 8(2), pages 191-213, December.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Antônio Francisco Neto & Carolina Rodrigues Fonseca, 2019. "An approach via generating functions to compute power indices of multiple weighted voting games with incompatible players," Annals of Operations Research, Springer, vol. 279(1), pages 221-249, August.
    2. Alonso-Meijide, J.M. & Casas-Méndez, B. & Fiestras-Janeiro, M.G., 2015. "Computing Banzhaf–Coleman and Shapley–Shubik power indices with incompatible players," Applied Mathematics and Computation, Elsevier, vol. 252(C), pages 377-387.
    3. Gusev, Vasily V., 2023. "Set-weighted games and their application to the cover problem," European Journal of Operational Research, Elsevier, vol. 305(1), pages 438-450.
    4. Gusev, Vasily V., 2020. "The vertex cover game: Application to transport networks," Omega, Elsevier, vol. 97(C).
    5. Antônio Francisco Neto, 2019. "Generating Functions of Weighted Voting Games, MacMahon’s Partition Analysis, and Clifford Algebras," Mathematics of Operations Research, INFORMS, vol. 44(1), pages 74-101, February.
    6. Vasily V. Gusev, 2021. "Set-weighted games and their application to the cover problem," HSE Working papers WP BRP 247/EC/2021, National Research University Higher School of Economics.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Antônio Francisco Neto & Carolina Rodrigues Fonseca, 2019. "An approach via generating functions to compute power indices of multiple weighted voting games with incompatible players," Annals of Operations Research, Springer, vol. 279(1), pages 221-249, August.
    2. Antônio Francisco Neto, 2019. "Generating Functions of Weighted Voting Games, MacMahon’s Partition Analysis, and Clifford Algebras," Mathematics of Operations Research, INFORMS, vol. 44(1), pages 74-101, February.
    3. Benati, Stefano & Rizzi, Romeo & Tovey, Craig, 2015. "The complexity of power indexes with graph restricted coalitions," Mathematical Social Sciences, Elsevier, vol. 76(C), pages 53-63.
    4. Stefano Benati & Giuseppe Vittucci Marzetti, 2021. "Voting power on a graph connected political space with an application to decision-making in the Council of the European Union," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 57(4), pages 733-761, November.
    5. A. Saavedra-Nieves, 2023. "On stratified sampling for estimating coalitional values," Annals of Operations Research, Springer, vol. 320(1), pages 325-353, January.
    6. A. Saavedra-Nieves & M. G. Fiestras-Janeiro, 2021. "Sampling methods to estimate the Banzhaf–Owen value," Annals of Operations Research, Springer, vol. 301(1), pages 199-223, June.
    7. Alonso-Meijide, J.M. & Bilbao, J.M. & Casas-Méndez, B. & Fernández, J.R., 2009. "Weighted multiple majority games with unions: Generating functions and applications to the European Union," European Journal of Operational Research, Elsevier, vol. 198(2), pages 530-544, October.
    8. Wilms, Ingo, 2020. "Dynamic programming algorithms for computing power indices in weighted multi-tier games," Mathematical Social Sciences, Elsevier, vol. 108(C), pages 175-192.
    9. Martí Jané Ballarín, 2023. "The complexity of power indices in voting games with incompatible players," UB School of Economics Working Papers 2023/441, University of Barcelona School of Economics.
    10. Luisa Monroy & Francisco Fernández, 2014. "Banzhaf index for multiple voting systems. An application to the European Union," Annals of Operations Research, Springer, vol. 215(1), pages 215-230, April.
    11. Yuto Ushioda & Masato Tanaka & Tomomi Matsui, 2022. "Monte Carlo Methods for the Shapley–Shubik Power Index," Games, MDPI, vol. 13(3), pages 1-14, June.
    12. Bhattacherjee, Sanjay & Chakravarty, Satya R. & Sarkar, Palash, 2022. "A General Model for Multi-Parameter Weighted Voting Games," MPRA Paper 115407, University Library of Munich, Germany.
    13. Somdeb Lahiri, 2021. "Pattanaik's axioms and the existence of winners preferred with probability at least half," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 31(2), pages 109-122.
    14. Alonso-Meijide, J.M. & Casas-Méndez, B. & Fiestras-Janeiro, M.G., 2015. "Computing Banzhaf–Coleman and Shapley–Shubik power indices with incompatible players," Applied Mathematics and Computation, Elsevier, vol. 252(C), pages 377-387.
    15. Bolus, Stefan, 2011. "Power indices of simple games and vector-weighted majority games by means of binary decision diagrams," European Journal of Operational Research, Elsevier, vol. 210(2), pages 258-272, April.
    16. José María Alonso-Meijide & Mikel Álvarez-Mozos & María Gloria Fiestras-Janeiro, 2015. "Power Indices and Minimal Winning Coalitions in Simple Games with Externalities Abstract: We propose a generalization of simple games to situations with coalitional externalities. The main novelty of ," UB School of Economics Working Papers 2015/328, University of Barcelona School of Economics.
    17. Gianfranco Gambarelli & Angelo Uristani, 2009. "Multicameral voting cohesion games," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 17(4), pages 433-460, December.
    18. Manfred Holler & Rie Ono & Frank Steffen, 2001. "Constrained Monotonicity and the Measurement of Power," Theory and Decision, Springer, vol. 50(4), pages 383-395, June.
    19. Vito Fragnelli & Gianfranco Gambarelli, 2014. "Further open problems in cooperative games," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 24(4), pages 51-62.
    20. Julien Reynaud & Fabien Lange & Łukasz Gątarek & Christian Thimann, 2011. "Proximity in Coalition Building," Central European Journal of Economic Modelling and Econometrics, Central European Journal of Economic Modelling and Econometrics, vol. 3(3), pages 111-132, September.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:topjnl:v:22:y:2014:i:2:p:658-673. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.