We show that concepts introduced by Aumann more than thirty years ago throw a new light on purification in games with extremely dispersed private information. We show that one can embed payoff-irrelevant randomization devices in the private information of players and use these randomization...

We show that concepts introduced by Aumann more than thirty years ago throw a new light on purification in games with extremely dispersed private information. We show that one can embed payoff-irrelevant randomization devices in the private information of players and use these randomization...

We establish the existence of sequential equilibria in general menu games, known to be suffcient to analyze common agency problems. In particular, we show that our result solves some unpleasant features of early approaches