Abstract

Following Schelling (1960), coordination problems have mainly been considered in a context where agents can achieve a common goal (e.g., rendezvous) only by taking common actions. Dynamic versions of this problem have been studied by Crawford and Haller (1990), Ponssard (1994), and Kramarz (1996). This paper considers an alternative dynamic formulation in which the common goal (dispersion) can only be achieved by agents taking distinct actions. The goal of spatial dispersion has been studied in static models of habitat selection, location or congestion games, and network analysis. Our results show how this goal can be achieved gradually, by indistinguishable non-communicating agents, in a dynamic setting