This paper examines the Dirty Faces problem as a Bayesian game. The equilibrium in the general form of the game requires the extreme assumption of common knowledge of rationality. However, for any finite number of players, the exact number of steps of iterated rationality necessary for the equilibrium to arise depends on the number of players of a particular type, allowing the game to be used to bound the number of steps satisfied by actual players. The game differs from other games used to study iterated rationality in that all players are better off when common knowledge of rationality is satisfied. While behavior in experiments is inconsistent with the game-theoretic prediction at the group level, individual level behavior shows a greater degree of consistency with theory and with previous results on iterated rationality. Finally, there is some evidence of learning in repeated play. Copyright Kluwer Academic Publishers 2001
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
page. 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.
Volume (Year): 4 (2001) Issue (Month): 3 (December) Pages: 229-242 Download reference. The following formats are available: HTML
(with abstract),
plain text
(with abstract),
BibTeX,
RIS (EndNote, RefMan, ProCite),
ReDIF
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.: