IDEAS home Printed from https://ideas.repec.org/p/hal/cesptp/halshs-00881125.html
   My bibliography  Save this paper

An allocation rule for dynamic random network formation processes

Author

Listed:
  • Jean-François Caulier

    () (CES - Centre d'économie de la Sorbonne - UP1 - Université Panthéon-Sorbonne - CNRS - Centre National de la Recherche Scientifique)

  • Michel Grabisch

    () (CES - Centre d'économie de la Sorbonne - UP1 - Université Panthéon-Sorbonne - CNRS - Centre National de la Recherche Scientifique, PSE - Paris School of Economics)

  • Agnieszka Rusinowska

    () (CES - Centre d'économie de la Sorbonne - UP1 - Université Panthéon-Sorbonne - CNRS - Centre National de la Recherche Scientifique, PSE - Paris School of Economics)

Abstract

Most allocation rules for network games presented in the literature assume that the network structure is fixed. We put explicit emphasis on the construction of networks and examine the dynamic formation of networks whose evolution across time periods is stochastic. Time-series of networks are studied that describe processes of network formation where links may appear or disappear at any period. Moreover, convergence to an efficient network is not necessarily prescribed. Transitions from one network to another are random and yield a Markov chain. We propose the link-based allocation rule for such dynamic random network formation processes and provide its axiomatic characterization. By considering a monotone game and a particular (natural) network formation process we recover the link-based flexible network allocation rule of Jackson.

Suggested Citation

  • Jean-François Caulier & Michel Grabisch & Agnieszka Rusinowska, 2013. "An allocation rule for dynamic random network formation processes," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-00881125, HAL.
  • Handle: RePEc:hal:cesptp:halshs-00881125
    Note: View the original document on HAL open archive server: https://halshs.archives-ouvertes.fr/halshs-00881125
    as

    Download full text from publisher

    File URL: https://halshs.archives-ouvertes.fr/halshs-00881125/document
    Download Restriction: no

    References listed on IDEAS

    as
    1. 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.
    2. Jean-François Caulier & Ana Mauleon & Vincent Vannetelbosch, 2013. "Contractually stable networks," International Journal of Game Theory, Springer;Game Theory Society, vol. 42(2), pages 483-499, May.
    3. Dutta, Bhaskar & Ghosal, Sayantan & Ray, Debraj, 2005. "Farsighted network formation," Journal of Economic Theory, Elsevier, vol. 122(2), pages 143-164, June.
    4. Page Jr., Frank H. & Wooders, Myrna, 2009. "Strategic basins of attraction, the path dominance core, and network formation games," Games and Economic Behavior, Elsevier, vol. 66(1), pages 462-487, May.
    5. Konishi, Hideo & Ray, Debraj, 2003. "Coalition formation as a dynamic process," Journal of Economic Theory, Elsevier, vol. 110(1), pages 1-41, May.
    6. Hamiache, Gerard, 1999. "A Value with Incomplete Communication," Games and Economic Behavior, Elsevier, vol. 26(1), pages 59-78, January.
    7. Haeringer, Guillaume, 2006. "A new weight scheme for the Shapley value," Mathematical Social Sciences, Elsevier, vol. 52(1), pages 88-98, July.
    8. Ghintran, Amandine, 2013. "Weighted position values," Mathematical Social Sciences, Elsevier, vol. 65(3), pages 157-163.
    9. Page Jr., Frank H. & Wooders, Myrna, 2007. "Networks and clubs," Journal of Economic Behavior & Organization, Elsevier, vol. 64(3-4), pages 406-425.
    10. Herings, P. Jean-Jacques & Mauleon, Ana & Vannetelbosch, Vincent, 2009. "Farsightedly stable networks," Games and Economic Behavior, Elsevier, vol. 67(2), pages 526-541, November.
    11. Perez-Castrillo, David & Wettstein, David, 2005. "Forming efficient networks," Economics Letters, Elsevier, vol. 87(1), pages 83-87, April.
    12. Perez-Castrillo, David & Wettstein, David, 2001. "Bidding for the Surplus : A Non-cooperative Approach to the Shapley Value," Journal of Economic Theory, Elsevier, vol. 100(2), pages 274-294, October.
    13. Slikker, Marco, 2007. "Bidding for surplus in network allocation problems," Journal of Economic Theory, Elsevier, vol. 137(1), pages 493-511, November.
    14. repec:hal:journl:halshs-00749950 is not listed on IDEAS
    15. Watts, Alison, 2002. "Non-myopic formation of circle networks," Economics Letters, Elsevier, vol. 74(2), pages 277-282, January.
    16. Dutta, Bhaskar & Mutuswami, Suresh, 1997. "Stable Networks," Journal of Economic Theory, Elsevier, vol. 76(2), pages 322-344, October.
      • Dutta, Bhaskar & Mutuswami, Suresh, 1996. "Stable Networks," Working Papers 971, California Institute of Technology, Division of the Humanities and Social Sciences.
    17. Ulrich Faigle & Michel Grabisch, 2012. "Values for Markovian coalition processes," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 51(3), pages 505-538, November.
    18. Jackson, Matthew O. & Watts, Alison, 2002. "The Evolution of Social and Economic Networks," Journal of Economic Theory, Elsevier, vol. 106(2), pages 265-295, October.
    19. Watts, Alison, 2001. "A Dynamic Model of Network Formation," Games and Economic Behavior, Elsevier, vol. 34(2), pages 331-341, February.
    20. Ulrich Faigle & Michel Grabisch, 2012. "Values for Markovian coalition processes," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-00749950, HAL.
    21. van den Nouweland, Anne & Slikker, Marco, 2012. "An axiomatic characterization of the position value for network situations," Mathematical Social Sciences, Elsevier, vol. 64(3), pages 266-271.
    22. Page Jr., Frank H. & Wooders, Myrna, 2010. "Club networks with multiple memberships and noncooperative stability," Games and Economic Behavior, Elsevier, vol. 70(1), pages 12-20, September.
    Full references (including those not matched with items on IDEAS)

    More about this item

    Keywords

    dynamic networks; network game; link-based allocation rule; Markov chain; characterization; réseaux dynamiques; jeu de réseau; règle d'allocation basée sur les liens; chaîne de Markov; caractérisation;

    NEP fields

    This paper has been announced in the following NEP Reports:

    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:cesptp:halshs-00881125. 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: (CCSD). General contact details of provider: https://hal.archives-ouvertes.fr/ .

    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.