Using spatial Poisson processes, we re-interpret the Imitation Dynamics and show how the spatial clustering of players affects both the selection of strategies and the speed by which they replicate. We find that the more clustered are the players, (a) the faster the evolution of strategies and...

A new model of strategic networking is developed and analyzed, where an agent’s investment in links is nonspecific. The model comprises a large class of games which are both potential and super- or submodular games. We obtain comparative statics results for Nash equilibria with respect to...

A new model of strategic networking is developed and analyzed, where an agent's investment in links is nonspecific. The model comprises a large class of games which are both potential and super- or submodular games. We obtain comparative statics results for Nash equilibria with respect to...

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...

A new model of strategic networking is developed and analyzed, where an agent’s investment in links is nonspecific. The model comprises a large class of games which are both potential and super- or submodular games. We obtain comparative statics results for Nash equilibria with respect to...

We consider a population of agents, either finite or countably infinite, located on an arbitrary network. Agents interact directly only with their immediate neighbors, but are able to observe the behavior of (some) other agents beyond their interaction neighborhood, and learn from that behavior...

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...

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...