This paper studies extensive form games with public information where all players have the same information at each point in time. We prove that when there are at least three players, all communication equilibrium payoffs can be obtained by unmediated cheap-talk procedures. The result encompasses repeated games and stochastic games.
Bibliographical noteFunding Information:
The research of Heller and Solan was supported by the Israel Science Foundation (grant number 212/09). Tristan Tomala acknowledges the support of the HEC Foundation and of the French ANR under grant ANR-10-BLAN 0112. The authors thank an anonymous referee, Francoise Forges and Peter Vida for pointing an inaccuracy in the proof and providing comments that improved the presentation.
- Communication equilibrium
- Distributed computation
- Normal-form correlated equilibrium