Local Interaction on Random Graphs†
Institut für Wirtschaftstheorie und Statistik (ETS), Universität Karlsruhe (TH), D-76128 Karlsruhe, Germany
Department of Economics, Virginia Polytechnic Institute and State University, Blacksburg, VA 24061-0316, USA
Author to whom correspondence should be addressed.
This manuscript was processed by the Editor-in-chief of the journal and not by the special issue’s guest editor.
Received: 29 June 2010 / Revised: 1 August 2010 / Accepted: 3 August 2010 / Published: 10 August 2010
PDF [361 KB, uploaded 10 August 2010]
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.
This is an open access article distributed under the Creative Commons Attribution License
(CC BY 3.0).
Share & Cite This Article
MDPI and ACS Style
Berninghaus, S.; Haller, H. Local Interaction on Random Graphs. Games 2010, 1, 262-285.
Berninghaus S, Haller H. Local Interaction on Random Graphs. Games. 2010; 1(3):262-285.
Berninghaus, Siegfried; Haller, Hans. 2010. "Local Interaction on Random Graphs." Games 1, no. 3: 262-285.
Show more citation formats
Show less citations formats
[Return to top]
For more information on the journal statistics, click here
Multiple requests from the same IP address are counted as one view.