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

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 common interest game whose common payoff to the players is at most equal to one—whose success set (the set...

A minimal diversity game is an n player strategic form game in which each player has m pure strategies at his disposal. The payoff to each player is always 1, unless all players select the same pure strategy, in which case all players receive zero payoff. Such a game has a unique isolated...

A minimal diversity game is an n player strategic form game in which each player has pure strategies at his disposal. The payoff to each player is always 1, unless all players select the same pure strategy, in which case all players receive zero payoff. Such a game has a unique isolated...

A minimal diversity game is an n player strategic form game in which each player has m pure strategies at his disposal. The payoff to each player is always 1, unless all players select the same pure strategy, in which case all players receive zero payoff. Such a game has a unique isolated...