IDEAS home Printed from https://ideas.repec.org/p/cor/louvrp/2717.html

Allocating value among farsighted players in network formation

Author

Listed:
  • CARAYOL, Nicolas
  • DELILLE , Rémy
  • VANNETELBOSCH, Vincent

Abstract

We propose a concept to study the stability of social and economic networks when players are farsighted and allocations are determined endogenously. A set of networks is a von Neumann-Morgenstern farsightedly stable set with bargaining if there exists an allocation rule and a bargaining threat such that (i) there is no farsighted improving path from one network inside the set to another network inside the set, (ii) from any network outside the set there is a farsighted improving path to some network inside the set, (iii) the value of each network is allocated among players so that players suffer or benefit equally from being linked to each other compared to the allocation they would obtain at their respective credible bargaining threat. We show that the set of strongly efficient networks is the unique von Neumann-Morgenstern farsightedly stable set with bargaining if the allocation rule is anonymous and component efficient and the value function is top convex. Moreover, the componentwise egalitarian allocation rule emerges endogenously.
(This abstract was borrowed from another version of this item.)

Suggested Citation

  • CARAYOL, Nicolas & DELILLE , Rémy & VANNETELBOSCH, Vincent, 2015. "Allocating value among farsighted players in network formation," LIDAM Reprints CORE 2717, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
  • Handle: RePEc:cor:louvrp:2717
    Note: In : Economics Letters, 137, 2015, p. 50-53
    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. Yangbo Song & Mihaela Schaar, 2020. "Dynamic network formation with foresighted agents," International Journal of Game Theory, Springer;Game Theory Society, vol. 49(2), pages 345-384, June.

    More about this item

    JEL classification:

    • A14 - General Economics and Teaching - - General Economics - - - Sociology of Economics
    • C70 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - General
    • D20 - Microeconomics - - Production and Organizations - - - General

    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:cor:louvrp:2717. 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: Alain GILLIS (email available below). General contact details of provider: https://edirc.repec.org/data/coreebe.html .

    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.