IDEAS home Printed from https://ideas.repec.org/p/ehu/ikerla/10330.html
   My bibliography  Save this paper

Expected Fair Allocation in Farsighted Network Formation

Author

Listed:
  • Navarro Prada, Noemí

Abstract

I consider cooperation situations where players have network relations. Networks evolve according to a stationary transition probability matrix and at each moment in time players receive payoffs from a stationary allocation rule. Players discount the future by a common factor. The pair formed by an allocation rule and a transition probability matrix is called expected fair if for every link in the network both participants gain, marginally, and in discounted, expected terms, the same from it; and it is called a pairwise network formation procedure if the probability that a link is created (or eliminated) is positive if the discounted, expected gains to its two participants are positive too. The main result is the existence, for the discount factor small enough, of an expected fair and pairwise network formation procedure where the allocation rule is component balanced, meaning it distributes the total value of any maximal connected subnetwork among its participants. This existence result holds for all discount factors when the pairwise network formation procedure is restricted. I finally provide some comparison with previous models of farsighted network formation.

Suggested Citation

  • Navarro Prada, Noemí, 2013. "Expected Fair Allocation in Farsighted Network Formation," IKERLANAK IKerlanak;2013-70, Universidad del País Vasco - Departamento de Fundamentos del Análisis Económico I.
  • Handle: RePEc:ehu:ikerla:10330
    as

    Download full text from publisher

    File URL: https://addi.ehu.es/handle/10810/10330
    Download Restriction: no

    Other versions of this item:

    References listed on IDEAS

    as
    1. Sergio Currarini & Massimo Morelli, 2000. "Network Formation with Sequential Demands," Royal Holloway, University of London: Discussion Papers in Economics 99/2, Department of Economics, Royal Holloway University of London, revised Feb 2000.
    2. Page, Frank Jr. & Wooders, Myrna H. & Kamat, Samir, 2005. "Networks and farsighted stability," Journal of Economic Theory, Elsevier, vol. 120(2), pages 257-269, February.
    3. Slikker, Marco & van den Nouweland, Anne, 2001. "A One-Stage Model of Link Formation and Payoff Division," Games and Economic Behavior, Elsevier, vol. 34(1), pages 153-175, January.
    4. Dutta, Bhaskar & Ghosal, Sayantan & Ray, Debraj, 2005. "Farsighted network formation," Journal of Economic Theory, Elsevier, vol. 122(2), pages 143-164, June.
    5. repec:cup:cbooks:9780511771576 is not listed on IDEAS
    6. Herings, P. Jean-Jacques & Mauleon, Ana & Vannetelbosch, Vincent, 2009. "Farsightedly stable networks," Games and Economic Behavior, Elsevier, vol. 67(2), pages 526-541, November.
    7. Sergio Currarini & Massimo Morelli, 2000. "original papers : Network formation with sequential demands," Review of Economic Design, Springer;Society for Economic Design, vol. 5(3), pages 229-249.
    8. Jackson, Matthew O., 2005. "Allocation rules for network games," Games and Economic Behavior, Elsevier, vol. 51(1), pages 128-154, April.
    9. 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.
    10. Sanjeev Goyal, 2007. "Introduction to Connections: An Introduction to the Economics of Networks," Introductory Chapters,in: Connections: An Introduction to the Economics of Networks Princeton University Press.
    11. Navarro, Noemí, 2010. "Flexible network rules for identified externalities," Games and Economic Behavior, Elsevier, vol. 69(2), pages 401-410, July.
    12. Navarro, Noemi, 2007. "Fair allocation in networks with externalities," Games and Economic Behavior, Elsevier, vol. 58(2), pages 354-364, February.
    13. Easley,David & Kleinberg,Jon, 2010. "Networks, Crowds, and Markets," Cambridge Books, Cambridge University Press, number 9780521195331, December.
    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. Navarro Prada, Noemí, 2013. "Forward-looking Pairwise Stability in Networks with Externalities," IKERLANAK Ikerlanak;2013-71, Universidad del País Vasco - Departamento de Fundamentos del Análisis Económico I.
    2. Jean-François Caulier & Michel Grabisch & Agnieszka Rusinowska, 2015. "An allocation rule for dynamic random network formation," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-01207823, HAL.
    3. Jean-François Caulier & Michel Grabisch & Agnieszka Rusinowska, 2015. "An allocation rule for dynamic random network formation processes," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 60(2), pages 283-313, October.
    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. Boncinelli, Leonardo & Pin, Paolo, 2014. "Efficiency and Stability in a Process of Teams Formation," MPRA Paper 56356, University Library of Munich, Germany.
    6. Jean-François Caulier & Michel Grabisch & Agnieszka Rusinowska, 2015. "An allocation rule for dynamic random network formation," PSE - Labex "OSE-Ouvrir la Science Economique" halshs-01207823, HAL.
    7. repec:hal:journl:halshs-01207823 is not listed on IDEAS

    More about this item

    Keywords

    Myerson value; allocation rules; Markov chain; strategic network formation; farsighted stability;

    JEL classification:

    • C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games
    • C79 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Other

    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:ehu:ikerla:10330. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Alcira Macías Redondo). General contact details of provider: http://edirc.repec.org/data/f1ehues.html .

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

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.