- freely available
Local Interaction on Random Graphs†
AbstractWe 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.
Share & Cite This Article
Berninghaus, S.; Haller, H. Local Interaction on Random Graphs. Games 2010, 1, 262-285.View more citation formats
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.
Notes: Multiple requests from the same IP address are counted as one view.