IDEAS home Printed from https://ideas.repec.org/a/bpj/bejtec/v13y2013i1p20n4.html
   My bibliography  Save this article

A Simple Bargaining Procedure for the Myerson Value

Author

Listed:
  • Navarro Noemí

    (Department of Economics, Université de Sherbrooke, Quebec, Canada)

  • Perea Andres

    (Epicenter and Department of Quantitative Economics, Maastricht University, Maastricht, Netherlands)

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

  • Navarro Noemí & Perea Andres, 2013. "A Simple Bargaining Procedure for the Myerson Value," The B.E. Journal of Theoretical Economics, De Gruyter, vol. 13(1), pages 131-150, May.
    • Handle: RePEc:bpj:bejtec:v:13:y:2013:i:1:p:20:n:4
    DOI: 10.1515/bejte-2012-0006
    as

    Download full text from publisher

    File URL: https://doi.org/10.1515/bejte-2012-0006
    Download Restriction: For access to full text, subscription to the journal or payment for the individual article is required.
    File URL: https://libkey.io/10.1515/bejte-2012-0006?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. 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. 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.
    3. Jackson, Matthew O., 2005. "Allocation rules for network games," Games and Economic Behavior, Elsevier, vol. 51(1), pages 128-154, April.
    4. (*), 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.
    5. 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.
    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. 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.
    8. 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.
    9. 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.
    10. Qin, Cheng-Zhong, 1996. "Endogenous Formation of Cooperation Structures," Journal of Economic Theory, Elsevier, vol. 69(1), pages 218-226, April.
    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. 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.
    5. Matthew Elliott & Arun Chandrasekhar & Attila Ambrus, 2015. "Social Investments, Informal Risk Sharing, and Inequality," 2015 Meeting Papers 189, Society for Economic Dynamics.
    6. 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.
    7. 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.
    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. Surajit Borkotokey & Sujata Goala & Niharika Kakoty & Parishmita Boruah, 2022. "The component-wise egalitarian Myerson value for Network Games," Papers 2201.02793, arXiv.org.
    2. 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.
    3. 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.
    4. 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.
    5. Juan Vidal-Puga, 2005. "Implementation of the Levels Structure Value," Annals of Operations Research, Springer, vol. 137(1), pages 191-209, July.
    6. Pin, Paolo, 2011. "Eight degrees of separation," Research in Economics, Elsevier, vol. 65(3), pages 259-270, September.
    7. Slikker, Marco, 2007. "Bidding for surplus in network allocation problems," Journal of Economic Theory, Elsevier, vol. 137(1), pages 493-511, November.
    8. repec:ebl:ecbull:v:3:y:2005:i:48:p:1-8 is not listed on IDEAS
    9. 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.
    10. Niharika Kakoty & Surajit Borkotokey & Rajnish Kumar & Abhijit Bora, 2024. "Weighted Myerson value for Network games," Papers 2402.11464, arXiv.org.
    11. 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.
    12. 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.
    13. 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.
    14. Sylvain Béal & Anna Khmelnitskaya & Philippe Solal, 2018. "Two-step values for games with two-level communication structure," Journal of Combinatorial Optimization, Springer, vol. 35(2), pages 563-587, February.
    15. Gustavo Bergantiños & Juan Vidal-Puga, 2004. "Realizing efficient outcomes in cost spanning problems," Game Theory and Information 0403001, University Library of Munich, Germany.
    16. 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.
    17. 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.
    18. Lars Ehlers, 2009. "Choosing wisely: the natural multi-bidding mechanism," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 39(3), pages 505-512, June.
    19. Subhadip Chakrabarti & Amandine Ghintran & Rajnish Kumar, 2019. "Assignment of heterogeneous agents in trees under the permission value," Review of Economic Design, Springer;Society for Economic Design, vol. 23(3), pages 155-188, December.
    20. Andrea Caggese & Ander Pérez-Orive, 2017. "Capital Misallocation and Secular Stagnation," Finance and Economics Discussion Series 2017-009, Board of Governors of the Federal Reserve System (U.S.).
    21. Pérez-Castrillo, David & Quérou, Nicolas, 2012. "Smooth multibidding mechanisms," Games and Economic Behavior, Elsevier, vol. 76(2), pages 420-438.

    More about this item

    Keywords

    Myerson value; networks; bargaining; cooperation;
    All these keywords.

    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:bpj:bejtec:v:13:y:2013:i:1:p:20:n:4. 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: Peter Golla (email available below). General contact details of provider: https://www.degruyter.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.