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

Expected fair allocation in farsighted network formation

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 consider situations in which a group of players extracts a value if they organise themselves in different network structures, and I define a solution concept to describe the decentralised decision that determines the network formation process and the allocation of the value. I demonstrate that there is a solution concept satisfying discounted expected versions of pairwise stability (Jackson and Wolinsky J Econ Theory 71:44–74, 1996 ) and fairness (Myerson Math Oper Res 2:225–229, 1977a ) jointly with the requirement that the allocation rule be component efficient if the players’ discount factor is sufficiently low. Copyright Springer-Verlag Berlin Heidelberg 2014
(This abstract was borrowed from another version of this item.)

Suggested Citation

  • Noemí Navarro, 2013. "Expected fair allocation in farsighted network formation," Post-Print hal-05113101, HAL.
    • Handle: RePEc:hal:journl:hal-05113101
    DOI: 10.1007/s00355-013-0777-4
    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. Michel Grabisch & Elena Parilina & Agnieszka Rusinowska & Georges Zaccour, 2025. "Dynamic Network Formation with Farsighted Players and Limited Capacities," Documents de travail du Centre d'Economie de la Sorbonne 25019, Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne.
    3. 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.
    4. Michel Grabisch & Antoine Mandel & Agnieszka Rusinowska, 2025. "Efficiency versus fairness in link recommendation algorithms," Documents de travail du Centre d'Economie de la Sorbonne 25001, Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne.

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