IDEAS home Printed from https://ideas.repec.org/a/spr/sochwe/v45y2015i4p819-827.html
   My bibliography  Save this article

Efficient extensions of the Myerson value

Author

Listed:
  • Sylvain Béal
  • André Casajus
  • Frank Huettner

Abstract

We study values for transferable utility games enriched by a communication graph (CO-games) where the graph does not necessarily affect the productivity but can influence the way the players distribute the worth generated by the grand coalition. Thus, we can envisage values that are efficient instead of values that are component efficient. For CO-games with connected graphs, efficiency and component efficiency coincide. In particular, the Myerson value (Myerson in Math Oper Res 2:22–229, 1977 ) is efficient for such games. Moreover, fairness is characteristic of the Myerson value. We identify the value that is efficient for all CO-games, coincides with the Myerson value for CO-games with connected graphs, and satisfies fairness. Copyright Springer-Verlag Berlin Heidelberg 2015

Suggested Citation

  • Sylvain Béal & André Casajus & Frank Huettner, 2015. "Efficient extensions of the Myerson value," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 45(4), pages 819-827, December.
    • Handle: RePEc:spr:sochwe:v:45:y:2015:i:4:p:819-827
    DOI: 10.1007/s00355-015-0885-4
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s00355-015-0885-4
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s00355-015-0885-4?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 look for a different version below or search for a different version of it.

    Other versions of this item:

    References listed on IDEAS

    as
    1. van den Brink, René & Khmelnitskaya, Anna & van der Laan, Gerard, 2012. "An efficient and fair solution for communication graph games," Economics Letters, Elsevier, vol. 117(3), pages 786-789.
    2. André Casajus, 2009. "Networks and outside options," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 32(1), pages 1-13, January.
    3. Béal, Sylvain & Rémila, Eric & Solal, Philippe, 2012. "Fairness and fairness for neighbors: The difference between the Myerson value and component-wise egalitarian solutions," Economics Letters, Elsevier, vol. 117(1), pages 263-267.
    4. Roger B. Myerson, 1977. "Graphs and Cooperation in Games," Mathematics of Operations Research, INFORMS, vol. 2(3), pages 225-229, August.
    5. Gérard Hamiache, 2012. "A Matrix Approach to TU Games with Coalition and Communication Structures," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 38(1), pages 85-100, January.
    6. Hart, Sergiu & Kurz, Mordecai, 1983. "Endogenous Formation of Coalitions," Econometrica, Econometric Society, vol. 51(4), pages 1047-1064, July.
    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. Sylvain Béal & André Casajus & Eric Rémila & Philippe Solal, 2021. "Cohesive efficiency in TU-games: axiomatizations of variants of the Shapley value, egalitarian values and their convex combinations," Annals of Operations Research, Springer, vol. 302(1), pages 23-47, July.
    2. Rong Zou & Genjiu Xu & Dongshuang Hou, 2023. "Efficient extensions of the Myerson value based on endogenous claims from players," Annals of Operations Research, Springer, vol. 323(1), pages 287-300, April.
    3. Sylvain Béal & André Casajus & Frank Huettner, 2018. "Efficient extensions of communication values," Annals of Operations Research, Springer, vol. 264(1), pages 41-56, May.
    4. Manuela Basallote & José M. Gallardo & Carmen Hernández-Mancera & Andrés Jiménez-Losada, 2024. "Allocation rules for communication situations with incompatibilities," Annals of Operations Research, Springer, vol. 340(2), pages 757-784, September.
    5. Xun-Feng Hu & Gen-Jiu Xu & Deng-Feng Li, 2019. "The Egalitarian Efficient Extension of the Aumann–Drèze Value," Journal of Optimization Theory and Applications, Springer, vol. 181(3), pages 1033-1052, June.
    6. Aguiar, Victor H. & Pongou, Roland & Tondji, Jean-Baptiste, 2018. "A non-parametric approach to testing the axioms of the Shapley value with limited data," Games and Economic Behavior, Elsevier, vol. 111(C), pages 41-63.
    7. Daniel Li Li & Erfang Shan, 2020. "Efficient quotient extensions of the Myerson value," Annals of Operations Research, Springer, vol. 292(1), pages 171-181, September.
    8. Tido Takeng, Rodrigue, 2022. "Uncertain production environment and communication structure," Journal of Mathematical Economics, Elsevier, vol. 102(C).
    9. Béal, Sylvain & Casajus, André & Huettner, Frank, 2016. "On the existence of efficient and fair extensions of communication values for connected graphs," Economics Letters, Elsevier, vol. 146(C), pages 103-106.
    10. Erfang Shan & Jilei Shi & Wenrong Lyu, 2023. "The efficient partition surplus Owen graph value," Annals of Operations Research, Springer, vol. 320(1), pages 379-392, January.
    11. Taiki Yamada, 2021. "New allocation rule of directed hypergraphs," Papers 2110.06506, arXiv.org, revised Feb 2023.
    12. Hu, Xun-Feng & Li, Deng-Feng & Xu, Gen-Jiu, 2018. "Fair distribution of surplus and efficient extensions of the Myerson value," Economics Letters, Elsevier, vol. 165(C), pages 1-5.

    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. Sylvain Béal & André Casajus & Frank Huettner, 2018. "Efficient extensions of communication values," Annals of Operations Research, Springer, vol. 264(1), pages 41-56, May.
    2. Béal, Sylvain & Casajus, André & Huettner, Frank, 2016. "On the existence of efficient and fair extensions of communication values for connected graphs," Economics Letters, Elsevier, vol. 146(C), pages 103-106.
    3. René Brink & Anna Khmelnitskaya & Gerard Laan, 2016. "An Owen-type value for games with two-level communication structure," Annals of Operations Research, Springer, vol. 243(1), pages 179-198, August.
    4. Guang Zhang & Erfang Shan & Liying Kang & Yanxia Dong, 2017. "Two efficient values of cooperative games with graph structure based on $$\tau $$ τ -values," Journal of Combinatorial Optimization, Springer, vol. 34(2), pages 462-482, August.
    5. Hu, Xun-Feng & Li, Deng-Feng & Xu, Gen-Jiu, 2018. "Fair distribution of surplus and efficient extensions of the Myerson value," Economics Letters, Elsevier, vol. 165(C), pages 1-5.
    6. Shan, Erfang & Zhang, Guang & Dong, Yanxia, 2016. "Component-wise proportional solutions for communication graph games," Mathematical Social Sciences, Elsevier, vol. 81(C), pages 22-28.
    7. Shi, Jilei & Shan, Erfang, 2020. "Weighted component-wise solutions for graph games," Economics Letters, Elsevier, vol. 192(C).
    8. Xun-Feng Hu & Gen-Jiu Xu & Deng-Feng Li, 2019. "The Egalitarian Efficient Extension of the Aumann–Drèze Value," Journal of Optimization Theory and Applications, Springer, vol. 181(3), pages 1033-1052, June.
    9. Sylvain Béal & Marc Deschamps & Mostapha Diss & Rodrigue Tido Takeng, 2024. "Cooperative games with diversity constraints," Working Papers hal-04447373, HAL.
    10. 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.
    11. Antonio Magaña & Francesc Carreras, 2018. "Coalition Formation and Stability," Group Decision and Negotiation, Springer, vol. 27(3), pages 467-502, June.
    12. González–Arangüena, E. & Manuel, C. & Owen, G. & del Pozo, M., 2017. "The within groups and the between groups Myerson values," European Journal of Operational Research, Elsevier, vol. 257(2), pages 586-600.
    13. Slikker, Marco & Dutta, Bhaskar & van den Nouweland, Anne & Tijs, Stef, 2000. "Potential maximizers and network formation," Mathematical Social Sciences, Elsevier, vol. 39(1), pages 55-70, January.
    14. C. Manuel & D. Martín, 2021. "A value for communication situations with players having different bargaining abilities," Annals of Operations Research, Springer, vol. 301(1), pages 161-182, June.
    15. Calvo, Emilio & Javier Lasaga, J. & Winter, Eyal, 1996. "The principle of balanced contributions and hierarchies of cooperation," Mathematical Social Sciences, Elsevier, vol. 31(3), pages 171-182, June.
    16. Kongo, Takumi, 2011. "Value of games with two-layered hypergraphs," Mathematical Social Sciences, Elsevier, vol. 62(2), pages 114-119, September.
    17. van den Brink, René & Khmelnitskaya, Anna & van der Laan, Gerard, 2012. "An efficient and fair solution for communication graph games," Economics Letters, Elsevier, vol. 117(3), pages 786-789.
    18. Edoardo Di Porto & Angela Parenti & Sonia Paty & Zineb Abidi, 2017. "Local government cooperation at work: a control function approach," Journal of Economic Geography, Oxford University Press, vol. 17(2), pages 435-463.
    19. Yoshio Kamijo, 2013. "The collective value: a new solution for games with coalition structures," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 21(3), pages 572-589, October.
    20. Jun, Tackseung & Kim, Jeong-Yoo, 2009. "Hypergraph Formation Game," Hitotsubashi Journal of Economics, Hitotsubashi University, vol. 50(2), pages 1-16, December.

    More about this item

    Keywords

    91A12; C71 ; D60;
    All these keywords.

    JEL classification:

    • C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games
    • D60 - Microeconomics - - Welfare Economics - - - General

    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:spr:sochwe:v:45:y:2015:i:4:p:819-827. 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.