Local Interaction on Random Graphs
We analyze dynamic local interaction in population games where the local interaction structure (modeled as a graph) can change over time: A stochastic process generates a random sequence of graphs. This contrasts with models where the initial interaction structure (represented by a deterministic graph or the realization of a random graph) cannot change over time.
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.:
- Alós-Ferrer, Carlos & Weidenholzer, Simon, 2008. "Contagion and efficiency," Journal of Economic Theory, Elsevier, vol. 143(1), pages 251-274, November.
- Alos-Ferrer, Carlos & Weidenholzer, Simon, 2006. "Imitation, local interactions, and efficiency," Economics Letters, Elsevier, vol. 93(2), pages 163-168, November.
- Dunia López-Pintado, 2006. "Contagion and coordination in random networks," International Journal of Game Theory, Springer, vol. 34(3), pages 371-381, October.
When requesting a correction, please mention this item's handle: RePEc:gam:jgames:v:1:y:2010:i:3:p:262-285:d:9233. 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: (XML Conversion Team)
If references are entirely missing, you can add them using this form.