The author shows how a group of individuals can learn to play a coordination game without any common knowledge and with only a small amount of rationality. The game is repeated many times by different players. Each player chooses an optimal reply based on incomplete information about what other players have done in the past. Occasionally they make mistakes. When the likelihood of mistakes is very small, typically one coordination equilibrium will be played almost all of the time over the long run. This stochastically stable equilibrium can be computed analytically using a general theorem the author proves on perturbed Markov processes. Copyright 1993 by The Econometric Society.
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.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Publisher Info
Article provided by Econometric Society in its journal Econometrica.
Volume (Year): 61 (1993) Issue (Month): 1 (January) Pages: 57-84 Download reference. The following formats are available: HTML,
plain text,
BibTeX,
RIS (EndNote),
ReDIF
Cited by: (explanations, 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.) This item has more than 25 citations. To prevent cluttering this page, these citations are listed on a separate page.
Did you know? Each page is provided with a technical contact, in case something is not right with the supplied information. See under "publisher info".