The goal of this paper is to illustrate the significance of information acquisition in mechanism design. We provide a stark example of a mechanism design problem in a collective choice environment with information acquisition. We concentrate on committees that are comprised of agents sharing a...

We study Blackwell's approachability in repeated games with vector payoffs when the approaching player is restricted to use strategies with bounded memory: either strategies with bounded recall, or strategies that can be implemented by finite automata. Our main finding is that the following...

We study a general model of dynamic games with purely informational externalities. We prove that eventually all motives for experimentation disappear, and provide the exact rate at which experimentation decays. We also provide tight conditions under which players eventually reach a consensus....

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...

We analyze a toy class of two-player repeated games with two-sided incomplete information. In our model, two players are facing independent decision problems and each of them holds information that is potentially valuable to the other player. We study to what extent, and how, information can be...