The Replicator Dynamic, Chain Components and the Response Graph
In this paper we examine the relationship between the flow of the replicator dynamic, the continuum limit of Multiplicative Weights Update, and a game's response graph. We settle an open problem establishing that under the replicator, sink chain components -- a topological notion of long-run outcome of a dynamical system -- always exist and are approximated by the sink connected components of the game's response graph. More specifically, each sink chain component contains a sink connected component of the response graph, as well as all mixed strategy profiles whose support consists of pure profiles in the same connected component, a set we call the content of the connected component. As a corollary, all profiles are chain recurrent in games with strongly connected response graphs. In any two-player game sharing a response graph with a zero-sum game, the sink chain component is unique. In two-player zero-sum and potential games the sink chain components and sink connected components are in a one-to-one correspondence, and we conjecture that this holds in all games.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Nested replicator dynamics, nested logit choice, and similarity-based learning
We consider a model of learning and evolution in games whose action sets are endowed with a partition-based similarity structure intended to capture exogenous similarities between strategies. In this model, revising agen…
A probabilistic interpretation of replicator-mutator dynamics
In this note, we investigate the relationship between probabilistic updating mechanisms and discrete-time replicator-mutator dynamics. We consider the recently shown connection between Bayesian updating and replicator dy…
A Finite Population Destroys a Traveling Wave in Spatial Replicator Dynamics
We derive both the finite and infinite population spatial replicator dynamics as the fluid limit of a stochastic cellular automaton. The infinite population spatial replicator is identical to the model used by Vickers an…
Spectral Clustering with Epidemic Diffusion
Spectral clustering is widely used to partition graphs into distinct modules or communities. Existing methods for spectral clustering use the eigenvalues and eigenvectors of the graph Laplacian, an operator that is close…
ClusteringThermodynamics of Darwinian evolution in molecular replicators
We consider the relationship between thermodynamics, fitness, and Darwinian evolution in autocatalytic molecular replicators. We uncover a thermodynamic bound that relates fitness, replication rate, and the Gibbs free en…