IDEAS home Printed from https://ideas.repec.org/a/eee/gamebe/v69y2010i2p401-410.html
   My bibliography  Save this article

Flexible network rules for identified externalities

Author

Listed:
  • Navarro, Noemí

Abstract

I propose three modifications of Jackson's flexible network axiom (Jackson, 2005) when the structure of externalities across components have been identified. The first one takes into account the information about the externalities across components. The second one allows for coalitional deviations once the network has been formed. Finally, the third one tries to find a compromise with component efficiency (Myerson, 1977a).

Suggested Citation

  • Navarro, Noemí, 2010. "Flexible network rules for identified externalities," Games and Economic Behavior, Elsevier, vol. 69(2), pages 401-410, July.
    • Handle: RePEc:eee:gamebe:v:69:y:2010:i:2:p:401-410
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0899-8256(10)00020-5
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. Jackson, Matthew O., 2005. "Allocation rules for network games," Games and Economic Behavior, Elsevier, vol. 51(1), pages 128-154, April.
    2. Jackson, Matthew O. & Wolinsky, Asher, 1996. "A Strategic Model of Social and Economic Networks," Journal of Economic Theory, Elsevier, vol. 71(1), pages 44-74, October.
    3. Roger B. Myerson, 1977. "Graphs and Cooperation in Games," Mathematics of Operations Research, INFORMS, vol. 2(3), pages 225-229, August.
    4. Navarro, Noemi, 2007. "Fair allocation in networks with externalities," Games and Economic Behavior, Elsevier, vol. 58(2), pages 354-364, February.
    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. 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.
    2. Hideto Koizumi, 2023. "The enemy of my enemy is my friend: new conditions for network games," Economic Theory Bulletin, Springer;Society for the Advancement of Economic Theory (SAET), vol. 11(2), pages 223-233, October.
    3. Noemí Navarro, 2014. "Expected fair allocation in farsighted network formation," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 43(2), pages 287-308, August.
    4. Carayol, Nicolas & Delille, Rémy & Vannetelbosch, Vincent, 2015. "Allocating value among farsighted players in network formation," Economics Letters, Elsevier, vol. 137(C), pages 50-53.
    5. Nils Roehl, 2013. "Two-Stage Allocation Rules," Working Papers CIE 73, Paderborn University, CIE Center for International Economics.
    6. Nils Roehl, 2013. "Two-Stage Allocation Rules," Working Papers Dissertations 01, Paderborn University, Faculty of Business Administration and Economics.

    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. Carayol, Nicolas & Delille, Rémy & Vannetelbosch, Vincent, 2015. "Allocating value among farsighted players in network formation," Economics Letters, Elsevier, vol. 137(C), pages 50-53.
    2. Noemí NAVARRO & Róbert VESZTEG, 2007. "Fair ultimatum: an experimental study of the Myerson value," Cahiers de Recherches Economiques du Département d'économie 07.05, Université de Lausanne, Faculté des HEC, Département d’économie.
    3. Noemí Navarro, 2008. "A Sensitive Flexible Network Approach," Working Papers 2008-2, Universidad de Málaga, Department of Economic Theory, Málaga Economic Theory Research Center, revised Sep 2008.
    4. Kamijo, Yoshio, 2009. "A linear proportional effort allocation rule," Mathematical Social Sciences, Elsevier, vol. 58(3), pages 341-353, November.
    5. 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.
    6. Swapnil Dhamal & Y. Narahari, 2015. "Formation of Stable Strategic Networks with Desired Topologies," Studies in Microeconomics, , vol. 3(2), pages 158-213, December.
    7. Hideto Koizumi, 2023. "The enemy of my enemy is my friend: new conditions for network games," Economic Theory Bulletin, Springer;Society for the Advancement of Economic Theory (SAET), vol. 11(2), pages 223-233, October.
    8. 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.
    9. Joss Sánchez-Pérez, 2019. "Solutions for network games and symmetric group representations," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 29(4), pages 95-123.
    10. Belau, Julia, 2016. "Outside option values for network games," Mathematical Social Sciences, Elsevier, vol. 84(C), pages 76-86.
    11. Surajit Borkotokey & Sujata Goala & Niharika Kakoty & Parishmita Boruah, 2022. "The component-wise egalitarian Myerson value for Network Games," Papers 2201.02793, arXiv.org.
    12. Borkotokey, Surajit & Chakrabarti, Subhadip & Gilles, Robert P. & Gogoi, Loyimee & Kumar, Rajnish, 2021. "Probabilistic network values," Mathematical Social Sciences, Elsevier, vol. 113(C), pages 169-180.
    13. Pin, Paolo, 2011. "Eight degrees of separation," Research in Economics, Elsevier, vol. 65(3), pages 259-270, September.
    14. Slikker, Marco, 2007. "Bidding for surplus in network allocation problems," Journal of Economic Theory, Elsevier, vol. 137(1), pages 493-511, November.
    15. Joost Vandenbossche & Thomas Demuynck, 2013. "Network Formation with Heterogeneous Agents and Absolute Friction," Computational Economics, Springer;Society for Computational Economics, vol. 42(1), pages 23-45, June.
    16. Noemí Navarro, 2014. "Expected fair allocation in farsighted network formation," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 43(2), pages 287-308, August.
    17. Jackson, Matthew O. & Zenou, Yves, 2015. "Games on Networks," Handbook of Game Theory with Economic Applications,, Elsevier.
    18. Newton, Jonathan, 2012. "Coalitional stochastic stability," Games and Economic Behavior, Elsevier, vol. 75(2), pages 842-854.
    19. P. Herings & Gerard Laan & Dolf Talman, 2007. "Socially Structured Games," Theory and Decision, Springer, vol. 62(1), pages 1-29, February.
    20. Niharika Kakoty & Surajit Borkotokey & Rajnish Kumar & Abhijit Bora, 2023. "Weighted position value for Network games," Papers 2308.03494, arXiv.org.

    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:gamebe:v:69:y:2010:i:2:p:401-410. 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/inca/622836 .

    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.