IDEAS home Printed from https://ideas.repec.org/a/eee/matsoc/v64y2012i3p247-257.html
   My bibliography  Save this article

Monotonicity of power in weighted voting games with restricted communication

Author

Listed:
  • Napel, Stefan
  • Nohn, Andreas
  • Alonso-Meijide, José Maria

Abstract

Indices that evaluate the distribution of power in simple games are commonly required to be monotonic in voting weights when the game represents a voting body such as a shareholder meeting, parliament, etc. The standard notions of local or global monotonicity are bound to be violated, however, if cooperation is restricted to coalitions that are connected by a communication graph. This paper proposes new monotonicity concepts for power in games with communication structure and investigates the monotonicity properties of the Myerson value, the restricted Banzhaf value, the position value, and the average tree solution.

Suggested Citation

  • Napel, Stefan & Nohn, Andreas & Alonso-Meijide, José Maria, 2012. "Monotonicity of power in weighted voting games with restricted communication," Mathematical Social Sciences, Elsevier, vol. 64(3), pages 247-257.
    • Handle: RePEc:eee:matsoc:v:64:y:2012:i:3:p:247-257
    DOI: 10.1016/j.mathsocsci.2012.05.008
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0165489612000571
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.mathsocsci.2012.05.008?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. Marco Slikker, 2005. "A characterization of the position value," International Journal of Game Theory, Springer;Game Theory Society, vol. 33(4), pages 505-514, November.
    2. Le Breton, Michel & Montero, Maria & Zaporozhets, Vera, 2012. "Voting power in the EU council of ministers and fair decision making in distributive politics," Mathematical Social Sciences, Elsevier, vol. 63(2), pages 159-173.
    3. Ambec, Stefan & Sprumont, Yves, 2002. "Sharing a River," Journal of Economic Theory, Elsevier, vol. 107(2), pages 453-462, December.
    4. Sanjeev Goyal, 2007. "Introduction to Connections: An Introduction to the Economics of Networks," Introductory Chapters, in: Connections: An Introduction to the Economics of Networks, Princeton University Press.
    5. Gérard Hamiache, 2011. "Graph monotonic values," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 37(2), pages 287-307, July.
    6. Manfred J. Holler & Stefan Napel, 2004. "Monotonicity of power and power measures," Theory and Decision, Springer, vol. 56(2_2), pages 93-111, February.
    7. Roger B. Myerson, 1977. "Graphs and Cooperation in Games," Mathematics of Operations Research, INFORMS, vol. 2(3), pages 225-229, August.
    8. Herings, P.J.J. & van der Laan, G. & Talman, A.J.J. & Yang, Z., 2010. "The average tree solution for cooperative games with communication structure," Games and Economic Behavior, Elsevier, vol. 68(2), pages 626-633, March.
    9. Herings, P. Jean Jacques & van der Laan, Gerard & Talman, Dolf, 2008. "The average tree solution for cycle-free graph games," Games and Economic Behavior, Elsevier, vol. 62(1), pages 77-92, January.
    10. Richard Baron & Sylvain Béal & Eric Rémila & Philippe Solal, 2011. "Average tree solutions and the distribution of Harsanyi dividends," International Journal of Game Theory, Springer;Game Theory Society, vol. 40(2), pages 331-349, May.
    11. René Brink & Gerard Laan & Vitaly Pruzhansky, 2011. "Harsanyi power solutions for graph-restricted games," International Journal of Game Theory, Springer;Game Theory Society, vol. 40(1), pages 87-110, February.
    12. Vega-Redondo,Fernando, 2007. "Complex Social Networks," Cambridge Books, Cambridge University Press, number 9780521674096, Enero-Abr.
    13. Curiel, I. & Pederzoli, G. & Tijs, S.H., 1989. "Sequencing games," Other publications TiSEM cd695be5-0f54-4548-a952-2, Tilburg University, School of Economics and Management.
    14. André Casajus, 2007. "The position value is the Myerson value, in a sense," International Journal of Game Theory, Springer;Game Theory Society, vol. 36(1), pages 47-55, September.
    15. Laruelle,Annick & Valenciano,Federico, 2011. "Voting and Collective Decision-Making," Cambridge Books, Cambridge University Press, number 9780521182638, Enero-Abr.
    16. Vega-Redondo,Fernando, 2007. "Complex Social Networks," Cambridge Books, Cambridge University Press, number 9780521857406, Enero-Abr.
    17. Borm, P.E.M. & Owen, G. & Tijs, S.H., 1992. "On the position value for communication situations," Other publications TiSEM 5a8473e4-1df7-42df-ad53-f, Tilburg University, School of Economics and Management.
    18. Takumi Kongo, 2010. "Difference between the position value and the Myerson value is due to the existence of coalition structures," International Journal of Game Theory, Springer;Game Theory Society, vol. 39(4), pages 669-675, October.
    19. 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.
    20. J. Alonso-Meijide & C. Bowles & M. Holler & S. Napel, 2009. "Monotonicity of power in games with a priori unions," Theory and Decision, Springer, vol. 66(1), pages 17-37, January.
    21. Marco Slikker, 2005. "Link Monotonic Allocation Schemes," International Game Theory Review (IGTR), World Scientific Publishing Co. Pte. Ltd., vol. 7(04), pages 473-489.
    22. Curiel, Imma & Pederzoli, Giorgio & Tijs, Stef, 1989. "Sequencing games," European Journal of Operational Research, Elsevier, vol. 40(3), pages 344-351, June.
    Full references (including those not matched with items on IDEAS)

    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. Suzuki, T. & Talman, A.J.J., 2011. "Solution Concepts for Cooperative Games with Circular Communication Structure," Discussion Paper 2011-100, Tilburg University, Center for Economic Research.
    2. Huseynov, T. & Talman, A.J.J., 2012. "The Communication Tree Value for TU-games with Graph Communication," Other publications TiSEM 6ba97d87-1ac6-4af7-a981-a, Tilburg University, School of Economics and Management.
    3. C. Manuel & E. Ortega & M. del Pozo, 2023. "Marginality and the position value," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 31(2), pages 459-474, July.
    4. Alexander Mayer, 2018. "Luxembourg in the Early Days of the EEC: Null Player or Not?," Games, MDPI, vol. 9(2), pages 1-12, May.
    5. Kamijo, Yoshio, 2009. "A linear proportional effort allocation rule," Mathematical Social Sciences, Elsevier, vol. 58(3), pages 341-353, November.
    6. Herings, P.J.J. & van der Laan, G. & Talman, A.J.J. & Yang, Z., 2010. "The average tree solution for cooperative games with communication structure," Games and Economic Behavior, Elsevier, vol. 68(2), pages 626-633, March.
    7. Anna Khmelnitskaya & Gerard van der Laan & Dolf Talman, 2016. "Centrality Rewarding Shapley and Myerson Values for Undirected Graph Games," Tinbergen Institute Discussion Papers 16-070/II, Tinbergen Institute.
    8. Daniel Li Li & Erfang Shan, 2024. "A new value for communication situations," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 100(2), pages 535-551, October.
    9. Béal, Sylvain & Rémila, Eric & Solal, Philippe, 2012. "Weighted component fairness for forest games," Mathematical Social Sciences, Elsevier, vol. 64(2), pages 144-151.
    10. Surajit Borkotokey & Sujata Goala & Niharika Kakoty & Parishmita Boruah, 2022. "The component-wise egalitarian Myerson value for Network Games," Papers 2201.02793, arXiv.org.
    11. Niharika Kakoty & Surajit Borkotokey & Rajnish Kumar & Abhijit Bora, 2024. "Weighted Myerson value for Network games," Papers 2402.11464, arXiv.org.
    12. Erfang Shan & Guang Zhang & Xiaokang Shan, 2018. "The degree value for games with communication structure," International Journal of Game Theory, Springer;Game Theory Society, vol. 47(3), pages 857-871, September.
    13. van den Nouweland, Anne & Slikker, Marco, 2012. "An axiomatic characterization of the position value for network situations," Mathematical Social Sciences, Elsevier, vol. 64(3), pages 266-271.
    14. Özer Selçuk & Takamasa Suzuki, 2023. "Comparable axiomatizations of the average tree solution and the Myerson value," International Journal of Game Theory, Springer;Game Theory Society, vol. 52(2), pages 333-362, June.
    15. Li, Daniel Li & Shan, Erfang, 2019. "The position value and the structures of graphs," Applied Mathematics and Computation, Elsevier, vol. 356(C), pages 190-197.
    16. Surajit Borkotokey & Loyimee Gogoi & Sudipta Sarangi, 2014. "A Survey of Player-based and Link-based Allocation Rules for Network Games," Studies in Microeconomics, , vol. 2(1), pages 5-26, June.
    17. Sylvain Béal & Amandine Ghintran & Eric Rémila & Philippe Solal, 2015. "The sequential equal surplus division for rooted forest games and an application to sharing a river with bifurcations," Theory and Decision, Springer, vol. 79(2), pages 251-283, September.
    18. van den Brink, René & van der Laan, Gerard & Moes, Nigel, 2013. "A strategic implementation of the Average Tree solution for cycle-free graph games," Journal of Economic Theory, Elsevier, vol. 148(6), pages 2737-2748.
    19. Arcaute, E. & Dyagilev, K. & Johari, R. & Mannor, S., 2013. "Dynamics in tree formation games," Games and Economic Behavior, Elsevier, vol. 79(C), pages 1-29.
    20. Sridhar Mandyam & Usha Sridhar, 2017. "DON and Shapley Value for Allocation among Cooperating Agents in a Network: Conditions for Equivalence," Studies in Microeconomics, , vol. 5(2), pages 143-161, December.

    More about this item

    Statistics

    Access and download statistics

    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:eee:matsoc:v:64:y:2012:i:3:p:247-257. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/inca/505565 .

    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.