In this paper, we consider K finite populations of boundedly rational agents whose preferences and information differ. Each period agents are randomly paired to play some coordination games. We show that several "special" (fixed) agents lead the coordination. In a mistake-free environment, all connected fixed agents have to coordinate on the same strategy. In the long run, as the probability of mistakes goes to zero, all agents coordinate on the same strategy. The long-run outcome is unique, if all fixed agents belong to the same population.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
file. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
Publisher Info
Paper provided by University of Pittsburgh, Department of Economics in its series Working Papers with number
307.
References listed on IDEAS Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
Edward L. Glaeser & Bruce Sacerdote & Jose A. Scheinkman, 1995.
"Crime and Social Interactions,"
NBER Working Papers
5026, National Bureau of Economic Research, Inc.
[Downloadable!] (restricted)