By: |
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. |
Keywords: |
Dynamic networks; network game; link-based allocation rule; Markov chain; characterization |
Date: |
2013–08 |
URL: |
http://d.repec.org/n?u=RePEc:hal:cesptp:halshs-00881125&r=net |