We show that Nash equilibrium components are universal for the collection of connected polyhedral sets. More precisely for every polyhedral set we construct a so-called binary game—a game where all players have two pure strategies and a common utility function with values either zero or...

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 [epsilon]-minimax regret as our solution concept and show that social choice correspondences that are...