IDEAS home Printed from https://ideas.repec.org/a/eee/ecolet/v146y2016icp103-106.html
   My bibliography  Save this article

On the existence of efficient and fair extensions of communication values for connected graphs

Author

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

Abstract

We study values for TU games with a communication graph (CO-values). In particular, we show that CO-values for connected graphs that are fair and efficient allow for a unique efficient and fair extension to the full domain.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ecolet:v:146:y:2016:i:c:p:103-106
    DOI: 10.1016/j.econlet.2016.07.030
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0165176516302786
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.econlet.2016.07.030?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. 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. 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.
    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.
    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. 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.
    2. 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.
    3. 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.

    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. 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.
    3. 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.
    4. 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.
    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. 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.
    7. 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.
    8. 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.
    9. 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.
    10. 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.
    11. Shi, Jilei & Shan, Erfang, 2020. "Weighted component-wise solutions for graph games," Economics Letters, Elsevier, vol. 192(C).
    12. 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.
    13. 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.
    14. 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.
    15. Sylvain Béal & Eric Rémila & Philippe Solal, 2016. "Characterizations of Three Linear Values for TU Games by Associated Consistency: Simple Proofs Using the Jordan Normal Form," International Game Theory Review (IGTR), World Scientific Publishing Co. Pte. Ltd., vol. 18(01), pages 1-21, March.
    16. 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.
    17. Florian Navarro, 2019. "Necessary players, Myerson fairness and the equal treatment of equals," Annals of Operations Research, Springer, vol. 280(1), pages 111-119, September.
    18. 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.
    19. Hu, Xun-Feng, 2019. "Coalitional surplus desirability and the equal surplus division value," Economics Letters, Elsevier, vol. 179(C), pages 1-4.
    20. Taiki Yamada, 2021. "New allocation rule of directed hypergraphs," Papers 2110.06506, arXiv.org, revised Feb 2023.

    More about this item

    Keywords

    Communication graph; Fairness; Efficiency; Efficient extension; Fair extension; Myerson value;
    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:eee:ecolet:v:146:y:2016:i:c:p:103-106. 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/ecolet .

    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.