Score contribution per author:
α: calibrated so average coauthorship-adjusted count equals average raw count
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