Many refinements of Nash equilibrium yield solution correspondences that do not have closed graph in the space of payoffs or information. This has significance for implementation theory, especially under complete information. If a planner is concerned that all equilibria of his mechanism yield a...

Consider two agents who learn the value of an unknown parameter by observing a sequence of private signals. The signals are independent and identically distributed across time but not necessarily across agents. We show that when each agent's signal space is finite, the agents will commonly learn...

We introduce a class of strategies that generalizes examples constructed in two-player games under imperfect private monitoring. A sequential equilibrium is belief-free if, after every private history, each player's continuation strategy is optimal independently of his belief about his...