Games 2010, 1(3), 262-285; doi:10.3390/g1030262
Article

Local Interaction on Random Graphs

Received: 29 June 2010; in revised form: 1 August 2010 / Accepted: 3 August 2010 / Published: 10 August 2010
(This article belongs to the Special Issue Social Networks and Network Formation)
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Abstract: 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.
Keywords: local interaction games; coordination games; random graphs; contagion
PDF Full-text Download PDF Full-Text [361 KB, uploaded 10 August 2010 08:40 CEST]

Export to BibTeX |
EndNote


MDPI and ACS Style

Berninghaus, S.; Haller, H. Local Interaction on Random Graphs. Games 2010, 1, 262-285.

AMA Style

Berninghaus S, Haller H. Local Interaction on Random Graphs. Games. 2010; 1(3):262-285.

Chicago/Turabian Style

Berninghaus, Siegfried; Haller, Hans. 2010. "Local Interaction on Random Graphs." Games 1, no. 3: 262-285.

Games EISSN 2073-4336 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert