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.

MoreLess

Year of publication:	2010
Authors:	Berninghaus, Siegfried ; Haller, Hans
Published in:	Games. - Basel : MDPI, ISSN 2073-4336. - Vol. 1.2010, 3, p. 262-285
Publisher:	Basel : MDPI
Subject:	local interaction games \| coordination games \| random graphs \| contagion

freely available

Full text |

More access options

doi.org

Check Google Scholar

In libraries world-wide (WorldCat)

In German libraries (KVK)

subito order

I need help

More details

Type of publication:	Article
Type of publication (narrower categories):	Article
Language:	English
Other identifiers:	10.3390/g1030262 [DOI] 749509325 [GVK] hdl:10419/98526 [Handle]
Source:	EconStor

Persistent link: https://www.econbiz.de/10010369390