IDEAS home Printed from https://ideas.repec.org/p/hal/journl/hal-05113100.html
   My bibliography  Save this paper

A Simple Bargaining Procedure for the Myerson Value

Author

Listed:
  • Noemí Navarro

    (CREM - Centre de recherche en économie et management - UNICAEN - Université de Caen Normandie - NU - Normandie Université - UR - Université de Rennes - CNRS - Centre National de la Recherche Scientifique, UR - Université de Rennes)

  • Andres Perea

Abstract

We consider situations where the cooperation and negotiation possibilities between pairs of agents are given by an undirected graph. Every connected component of agents has a value, which is the total surplus the agents can generate by working together. We present a simple, sequential, bilateral bargaining procedure, in which at every stage the two agents in a link, (i,j) bargain about their share from cooperation in the connected component they are part of. We show that this procedure yields the Myerson value (Myerson, 1997) if the marginal value of any link in a connected component is increasing in the number of links in that connected component.

Suggested Citation

  • Noemí Navarro & Andres Perea, 2013. "A Simple Bargaining Procedure for the Myerson Value," Post-Print hal-05113100, HAL.
    • Handle: RePEc:hal:journl:hal-05113100
    DOI: 10.1515/bejte-2012-0006
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Other versions of this item:

    References listed on IDEAS

    as
    1. Vidal-Puga, Juan & Bergantinos, Gustavo, 2003. "An implementation of the Owen value," Games and Economic Behavior, Elsevier, vol. 44(2), pages 412-427, August.
    2. Jackson, Matthew O., 2005. "Allocation rules for network games," Games and Economic Behavior, Elsevier, vol. 51(1), pages 128-154, April.
    3. Perez-Castrillo, David & Wettstein, David, 2001. "Bidding for the Surplus : A Non-cooperative Approach to the Shapley Value," Journal of Economic Theory, Elsevier, vol. 100(2), pages 274-294, October.
    4. 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.
    5. van den Nouweland, Anne & Borm, Peter, 1991. "On the Convexity of Communication Games," International Journal of Game Theory, Springer;Game Theory Society, vol. 19(4), pages 421-430.
    6. (*), Y. Stephen Chiu & Ani Dasgupta, 1998. "On implementation via demand commitment games," International Journal of Game Theory, Springer;Game Theory Society, vol. 27(2), pages 161-189.
    7. 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.
    8. Qin, Cheng-Zhong, 1996. "Endogenous Formation of Cooperation Structures," Journal of Economic Theory, Elsevier, vol. 69(1), pages 218-226, April.
    9. Vazquez-Brage, Margarita & Garcia-Jurado, Ignacio & Carreras, Francesc, 1996. "The Owen Value Applied to Games with Graph-Restricted Communication," Games and Economic Behavior, Elsevier, vol. 12(1), pages 42-53, January.
    10. Calvo, Emilio & Lasaga, Javier & van den Nouweland, Anne, 1999. "Values of games with probabilistic graphs," Mathematical Social Sciences, Elsevier, vol. 37(1), pages 79-95, 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. 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.
    2. Catherine C. Fontenay & Joshua S. Gans, 2014. "Bilateral Bargaining with Externalities," Journal of Industrial Economics, Wiley Blackwell, vol. 62(4), pages 756-788, December.
    3. Fioriti, Davide & Frangioni, Antonio & Poli, Davide, 2021. "Optimal sizing of energy communities with fair revenue sharing and exit clauses: Value, role and business model of aggregators and users," Applied Energy, Elsevier, vol. 299(C).
    4. Attila Ambrus & Matt Elliott, 2021. "Investments in social ties, risk sharing, and inequality [“Collaboration Networks, Structural Holes, and Innovation: A Longitudinal Study”]," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 88(4), pages 1624-1664.
    5. Philippe Solal & Sylvain Béal & Sylvain Ferrières & Eric Rémila, 2017. "Axiomatic and bargaining foundation of an allocation rule for ordered tree TU-games," Post-Print halshs-01644811, HAL.
    6. Matthew Elliott & Arun Chandrasekhar & Attila Ambrus, 2015. "Social Investments, Informal Risk Sharing, and Inequality," 2015 Meeting Papers 189, Society for Economic Dynamics.
    7. Attila Ambrus & Arun G. Chandrasekhar & Matt Elliott, 2014. "Social Investments, Informal Risk Sharing, and Inequality," NBER Working Papers 20669, National Bureau of Economic Research, Inc.
    8. Xiaowei Yu & Keith Waehrer, 2024. "Recursive Nash-in-Nash bargaining solution," Economics Bulletin, AccessEcon, vol. 44(1), pages 11-24.

    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. 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.
    2. Pin, Paolo, 2011. "Eight degrees of separation," Research in Economics, Elsevier, vol. 65(3), pages 259-270, September.
    3. Yuan Ju & David Wettstein, 2009. "Implementing cooperative solution concepts: a generalized bidding approach," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 39(2), pages 307-330, May.
    4. Surajit Borkotokey & Sujata Goala & Niharika Kakoty & Parishmita Boruah, 2022. "The component-wise egalitarian Myerson value for Network Games," Papers 2201.02793, arXiv.org.
    5. Parishmita Boruah & Niharika Kakoty & Surajit Borkotokey, 2025. "The k-Egalitarian Myerson Values: Characterizations and Implementation," SN Operations Research Forum, Springer, vol. 6(1), pages 1-25, March.
    6. David Pérez-Castrillo & David Wettstein, 2005. "Implementation of the Ordinal Shapley Value for a three-agent economy," Economics Bulletin, AccessEcon, vol. 3(48), pages 1-8.
    7. Niharika Kakoty & Surajit Borkotokey & Rajnish Kumar & Abhijit Bora, 2024. "Weighted Myerson value for Network games," Papers 2402.11464, arXiv.org.
    8. Macho-Stadler, Ines & Perez-Castrillo, David & Wettstein, David, 2006. "Efficient bidding with externalities," Games and Economic Behavior, Elsevier, vol. 57(2), pages 304-320, November.
    9. Gómez, D. & González-Arangüena, E. & Manuel, C. & Owen, G., 2008. "A value for generalized probabilistic communication situations," European Journal of Operational Research, Elsevier, vol. 190(2), pages 539-556, October.
    10. Juan Vidal-Puga, 2005. "Implementation of the Levels Structure Value," Annals of Operations Research, Springer, vol. 137(1), pages 191-209, July.
    11. Slikker, Marco, 2007. "Bidding for surplus in network allocation problems," Journal of Economic Theory, Elsevier, vol. 137(1), pages 493-511, November.
    12. repec:ebl:ecbull:v:3:y:2005:i:48:p:1-8 is not listed on IDEAS
    13. Caulier, Jean-François & Mauleon, Ana & Vannetelbosch, Vincent, 2015. "Allocation rules for coalitional network games," Mathematical Social Sciences, Elsevier, vol. 78(C), pages 80-88.
    14. Bergantiños, Gustavo & Vidal-Puga, Juan, 2010. "Realizing fair outcomes in minimum cost spanning tree problems through non-cooperative mechanisms," European Journal of Operational Research, Elsevier, vol. 201(3), pages 811-820, March.
    15. Sylvain Béal & Eric Rémila & Philippe Solal, 2015. "Discounted Tree Solutions," Working Papers hal-01377923, HAL.
    16. 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.
    17. Rod Garratt & James E. Parco & Cheng-Zhong Qin & Amnon Rapoport, 2005. "Potential Maximization And Coalition Government Formation," International Game Theory Review (IGTR), World Scientific Publishing Co. Pte. Ltd., vol. 7(04), pages 407-429.
    18. Ander Perez-Orive & Andrea Caggese, 2017. "Capital Misallocation and Secular Stagnation," 2017 Meeting Papers 382, Society for Economic Dynamics.
    19. 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.
    20. Gabrielle Demange, 2017. "The stability of group formation," Revue d'économie politique, Dalloz, vol. 127(4), pages 495-516.
    21. 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.

    More about this item

    JEL classification:

    • C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games
    • C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative 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:hal:journl:hal-05113100. 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: CCSD (email available below). General contact details of provider: https://hal.archives-ouvertes.fr/ .

    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.