This note studies the problem of implementing social choice correspondences in environments where individuals have doubts about the rationality of their opponents. We postulate the concept of "-minimax regret as our solution concept and show that social choice correspondences that are Maskin...

This note studies the problem of implementing social choice correspondences in environments where individuals have doubts about the rationality of their opponents. We postulate the concept of ε-minimax regret as our solution concept and show that social choice correspondences that are Maskin...

Games with multiple Nash equilibria are believed to be easier to play if players can communicate. We present a simple model of communication in games and investigate the importance of when communication takes place. Sending a message before play captures talk about intentions, after play...

In a recent paper, [Bergemann et al. 2017a], we derive results about equilibrium behavior in the first-price auction that hold across all common-prior information structures. The purpose of this letter is to give an informal introduction into the results. At the end we offer a brief discussion...