Advanced Search
MyIDEAS: Login

An allocation rule for dynamic random network formation processes

Contents:

Author Info

  • Jean-François Caulier

    ()
    (CES - Centre d'économie de la Sorbonne - CNRS : UMR8174 - Université Paris I - Panthéon-Sorbonne)

  • Michel Grabisch

    ()
    (CES - Centre d'économie de la Sorbonne - CNRS : UMR8174 - Université Paris I - Panthéon-Sorbonne, EEP-PSE - Ecole d'Économie de Paris - Paris School of Economics - Ecole d'Économie de Paris)

  • Agnieszka Rusinowska

    ()
    (CES - Centre d'économie de la Sorbonne - CNRS : UMR8174 - Université Paris I - Panthéon-Sorbonne, EEP-PSE - Ecole d'Économie de Paris - Paris School of Economics - Ecole d'Économie de Paris)

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.

Download Info

If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
File URL: http://halshs.archives-ouvertes.fr/docs/00/88/11/25/PDF/13063.pdf
Download Restriction: no

Bibliographic Info

Paper provided by HAL in its series Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) with number halshs-00881125.

as in new window
Length:
Date of creation: Aug 2013
Date of revision:
Handle: RePEc:hal:cesptp:halshs-00881125

Note: View the original document on HAL open archive server: http://halshs.archives-ouvertes.fr/halshs-00881125
Contact details of provider:
Web page: http://hal.archives-ouvertes.fr/

Related research

Keywords: Dynamic networks; network game; link-based allocation rule; Markov chain; characterization;

This paper has been announced in the following NEP Reports:

References

References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
as in new window
  1. Dutta, Bhaskar & Ghosal, Sayantan & Ray, Debraj, 2005. "Farsighted network formation," Journal of Economic Theory, Elsevier, vol. 122(2), pages 143-164, June.
  2. Jean-Francois Caulier & Ana Mauleon & Vincent VAnnetelbosch, 2007. "Contractually Stable Networks," NajEcon Working Paper Reviews 843644000000000084, www.najecon.org.
  3. David Pérez-Castrillo & David Wettstein, 2004. "Forming Efficient Networks," UFAE and IAE Working Papers 609.04, Unitat de Fonaments de l'Anàlisi Econòmica (UAB) and Institut d'Anàlisi Econòmica (CSIC).
  4. Page Jr. Frank H & Wooders, Myrna & Kamat, Samir, 2003. "Networks and Farsighted Stability," The Warwick Economics Research Paper Series (TWERPS) 689, University of Warwick, Department of Economics.
  5. Hamiache, Gerard, 1999. "A Value with Incomplete Communication," Games and Economic Behavior, Elsevier, vol. 26(1), pages 59-78, January.
  6. repec:hal:journl:halshs-00749950 is not listed on IDEAS
  7. Frank H. Page, Jr. & Myrna H. Wooders, 2006. "Strategic Basins of Attraction, the Path Dominance Core, and Network Formation Games," Vanderbilt University Department of Economics Working Papers 0614, Vanderbilt University Department of Economics.
  8. 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.
  9. 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.
  10. Watts, Alison, 2002. "Non-myopic formation of circle networks," Economics Letters, Elsevier, vol. 74(2), pages 277-282, January.
  11. Konishi, Hideo & Ray, Debraj, 2003. "Coalition formation as a dynamic process," Journal of Economic Theory, Elsevier, vol. 110(1), pages 1-41, May.
  12. repec:hal:cesptp:hal-00633611 is not listed on IDEAS
  13. Guillaume HAERINGER, 1999. "A New Weight Scheme for the Shapley Value," Working Papers of BETA 9910, Bureau d'Economie Théorique et Appliquée, UDS, Strasbourg.
  14. Jackson, Matthew O., 1998. "The Evolution of Social and Economic Networks," Working Papers 1044, California Institute of Technology, Division of the Humanities and Social Sciences.
  15. Ulrich Faigle & Michel Grabisch, 2012. "Values for Markovian coalition processes," PSE - Labex "OSE-Ouvrir la Science Economique" halshs-00749950, HAL.
  16. Ghintran, Amandine, 2013. "Weighted position values," Mathematical Social Sciences, Elsevier, vol. 65(3), pages 157-163.
  17. HERINGS, Jean-Jacques & MAULEON, Ana & VANNETELBOSCH, Vincent, 2006. "Farsightedly stable networks," CORE Discussion Papers 2006092, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
  18. Frank H. Page, Jr., Myrna H. Wooders, 2009. "Club Networks with Multiple Memberships and Noncooperative Stability," Caepr Working Papers 2009-005, Center for Applied Economics and Policy Research, Economics Department, Indiana University Bloomington.
  19. Watts, Alison, 2001. "A Dynamic Model of Network Formation," Games and Economic Behavior, Elsevier, vol. 34(2), pages 331-341, February.
  20. Slikker, Marco, 2007. "Bidding for surplus in network allocation problems," Journal of Economic Theory, Elsevier, vol. 137(1), pages 493-511, November.
  21. David Pérez-Castrillo & David Wettstein, . "Bidding For The Surplus: A Non-Cooperative Approach To The Shapley Value," UFAE and IAE Working Papers 461.00, Unitat de Fonaments de l'Anàlisi Econòmica (UAB) and Institut d'Anàlisi Econòmica (CSIC).
  22. Page Jr., Frank H. & Wooders, Myrna, 2007. "Networks and clubs," Journal of Economic Behavior & Organization, Elsevier, vol. 64(3-4), pages 406-425.
  23. repec:hal:cesptp:halshs-00749950 is not listed on IDEAS
Full references (including those not matched with items on IDEAS)

Citations

Lists

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

Statistics

Access and download statistics

Corrections

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

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 references are entirely missing, you can add them using this form.

If the full references list an item that is present in RePEc, but the system did not link 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 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.