IDEAS home Printed from https://ideas.repec.org/p/hal/journl/hal-05113094.html

Flexible network rules for identified externalities

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)

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).
(This abstract was borrowed from another version of this item.)

Suggested Citation

  • Noemí Navarro, 2010. "Flexible network rules for identified externalities," Post-Print hal-05113094, HAL.
  • Handle: RePEc:hal:journl:hal-05113094
    DOI: 10.1016/j.geb.2010.01.004
    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
    for a similarly titled item that would be available.

    Other versions of this item:

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. is not listed on IDEAS
    2. 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.
    3. 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.
    4. 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.
    5. Nils Roehl, 2013. "Two-Stage Allocation Rules," Working Papers Dissertations 01, Paderborn University, Faculty of Business Administration and Economics.
    6. Nils Roehl, 2013. "Two-Stage Allocation Rules," Working Papers CIE 73, Paderborn University, CIE Center for International Economics.
    7. 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.

    More about this item

    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-05113094. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.