An allocation rule for dynamic random network formation

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 ruled by a stochastic process, typically a Markov chain. We propose the link-based scenario 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 (2015).
Complete list of metadatas

Cited literature [54 references]  Display  Hide  Download

https://halshs.archives-ouvertes.fr/halshs-01207823
Contributor : Michel Grabisch <>
Submitted on : Thursday, October 1, 2015 - 2:02:47 PM
Last modification on : Tuesday, March 27, 2018 - 11:48:04 AM
Long-term archiving on : Saturday, January 2, 2016 - 11:05:26 AM

File

allocation-rule-dynamic3.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : halshs-01207823, version 1

Collections

Citation

Jean-François Caulier, Michel Grabisch, Agnieszka Rusinowska. An allocation rule for dynamic random network formation. Economic Theory, Springer Verlag, 2015. ⟨halshs-01207823⟩

Share

Metrics

Record views

455

Files downloads

656