IDEAS home Printed from https://ideas.repec.org/a/spr/jogath/v49y2020i1d10.1007_s00182-019-00688-y.html
   My bibliography  Save this article

Associated consistency, value and graphs

Author

Listed:
  • Gérard Hamiache

    (LEM (UMR CNRS 9221), University of Lille, Domaine Universitaire du Pont de Bois)

  • Florian Navarro

    (LEM (UMR CNRS 9221), University of Lille, Domaine Universitaire du Pont de Bois)

Abstract

This article presents an axiomatic characterization of a new value for cooperative games with incomplete communication. The result is obtained by slight modifications of associated games proposed by Hamiache (Games Econ Behav 26:59–78, 1999; Int J Game Theory 30:279–289, 2001). This new associated game can be expressed as a matrix formula. We generate a series of successive associated games and show that its limit is an inessential game. Three axioms (associated consistency, inessential game, continuity) characterize a unique sharing rule. Combinatorial arguments and matrix tools provide a procedure to compute the solution. The new sharing rule coincides with the Shapley value when the communication is complete.

Suggested Citation

  • Gérard Hamiache & Florian Navarro, 2020. "Associated consistency, value and graphs," International Journal of Game Theory, Springer;Game Theory Society, vol. 49(1), pages 227-249, March.
    • Handle: RePEc:spr:jogath:v:49:y:2020:i:1:d:10.1007_s00182-019-00688-y
    DOI: 10.1007/s00182-019-00688-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s00182-019-00688-y
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s00182-019-00688-y?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. Hamiache, Gerard, 1999. "A Value with Incomplete Communication," Games and Economic Behavior, Elsevier, vol. 26(1), pages 59-78, January.
    2. Gérard Hamiache, 2004. "A mean value for games with communication structures," International Journal of Game Theory, Springer;Game Theory Society, vol. 32(4), pages 533-544, August.
    3. 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.
    4. Hart, Sergiu & Mas-Colell, Andreu, 1989. "Potential, Value, and Consistency," Econometrica, Econometric Society, vol. 57(3), pages 589-614, May.
    5. Roger B. Myerson, 1977. "Graphs and Cooperation in Games," Mathematics of Operations Research, INFORMS, vol. 2(3), pages 225-229, August.
    6. 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.
    7. Gérard Hamiache, 2001. "Associated consistency and Shapley value," International Journal of Game Theory, Springer;Game Theory Society, vol. 30(2), pages 279-289.
    8. Gérard Hamiache, 2010. "A Matrix Approach To The Associated Consistency With An Application To The Shapley Value," International Game Theory Review (IGTR), World Scientific Publishing Co. Pte. Ltd., vol. 12(02), pages 175-187.
    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. Florian Navarro, 2022. "Associated consistency and the Aumann-Drèze value," Post-Print hal-03678064, HAL.
    2. Navarro, Florian, 2020. "The center value: A sharing rule for cooperative games on acyclic graphs," Mathematical Social Sciences, Elsevier, vol. 105(C), pages 1-13.
    3. Florian Navarro, 2022. "Associated consistency and the Aumann-Drèze value," Working Papers hal-03678064, HAL.

    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. Navarro, Florian, 2020. "The center value: A sharing rule for cooperative games on acyclic graphs," Mathematical Social Sciences, Elsevier, vol. 105(C), pages 1-13.
    2. Sylvain Béal & Sylvain Ferrières & Eric Rémila & Philippe Solal, 2017. "Axiomatic and bargaining foundation of an allocation rule for ordered tree TU-games," Post-Print halshs-01644797, HAL.
    3. A. Ghintran & E. González-Arangüena & C. Manuel, 2012. "A probabilistic position value," Annals of Operations Research, Springer, vol. 201(1), pages 183-196, December.
    4. Takashi Ui & Hiroyuki Kojima & Atsushi Kajii, 2011. "The Myerson value for complete coalition structures," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 74(3), pages 427-443, December.
    5. Niharika Kakoty & Surajit Borkotokey & Rajnish Kumar & Abhijit Bora, 2024. "Weighted Myerson value for Network games," Papers 2402.11464, arXiv.org.
    6. Daniel Li Li & Erfang Shan, 2022. "Safety of links with respect to the Myerson value for communication situations," Operational Research, Springer, vol. 22(3), pages 2121-2131, July.
    7. Florian Navarro, 2022. "Associated consistency and the Aumann-Drèze value," Working Papers hal-03678064, HAL.
    8. Béal, Sylvain & Ferrières, Sylvain & Rémila, Eric & Solal, Philippe, 2018. "Axiomatization of an allocation rule for ordered tree TU-games," Mathematical Social Sciences, Elsevier, vol. 93(C), pages 132-140.
    9. 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.
    10. Florian Navarro, 2022. "Associated consistency and the Aumann-Drèze value," Post-Print hal-03678064, HAL.
    11. Yan-An Hwang, 2015. "A convergent transfer scheme based on the complement-associated game," Economic Theory Bulletin, Springer;Society for the Advancement of Economic Theory (SAET), vol. 3(2), pages 255-263, October.
    12. 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.
    13. Jean-François Caulier & Michel Grabisch & Agnieszka Rusinowska, 2015. "An allocation rule for dynamic random network formation processes," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 60(2), pages 283-313, October.
    14. 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.
    15. 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.
    16. Sylvain Béal & Eric Rémila & Philippe Solal, 2015. "Discounted Tree Solutions," Working Papers hal-01377923, HAL.
    17. Slikker, M. & Gilles, R.P. & Norde, H.W. & Tijs, S.H., 2000. "Directed Communication Networks," Discussion Paper 2000-84, Tilburg University, Center for Economic Research.
    18. Ichiro Nishizaki & Tomohiro Hayashida & Yuki Shintomi, 2016. "A core-allocation for a network restricted linear production game," Annals of Operations Research, Springer, vol. 238(1), pages 389-410, March.
    19. Liying Kang & Anna Khmelnitskaya & Erfang Shan & Dolf Talman & Guang Zhang, 2021. "The average tree value for hypergraph games," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 94(3), pages 437-460, December.
    20. 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.

    More about this item

    Keywords

    Cooperative games; Graphs; Associated consistency; Shapley value;
    All these keywords.

    JEL classification:

    • C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games

    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:jogath:v:49:y:2020:i:1:d:10.1007_s00182-019-00688-y. 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.