We study the structure of the set of equilibrium payoffs in finite games, both for Nash equilibrium and correlated equilibrium. A nonempty subset of R^2 is shown to be the set of Nash equilibrium payoffs of a bimatrix game if and only if it is a finite union of rectangles. Furthermore, we show...

We study Blackwell's approachability in repeated games with vector payoffs when the approaching player is restricted to use strategies with bounded memory: either strategies with bounded recall, or strategies that can be implemented by finite automata. Our main finding is that the following...

Abstract We study the structure of the set of equilibrium payoffs in finite games, both for Nash and correlated equilibria. In the two-player case, we obtain a full characterization: if U and P are subsets of , then there exists a bimatrix game whose sets of Nash and correlated equilibrium...

We study the structure of the set of equilibrium payoffs in finite games, both for Nash equilibrium and correlated equilibrium. A nonempty subset of R^2 is shown to be the set of Nash equilibrium payoffs of a bimatrix game if and only if it is a finite union of rectangles. Furthermore, we show...

We study stopping games in the setup of Neveu. We prove the existence of a uniform value (in a sense defined below), by allowing the players to use randomized strategies. In contrast with previous work, we make no comparison assumption on the payoff processes. Moreover, we prove that the value...

"There is no place where espionage is not possible." -Sun Tzu, The Art of War, approximately 500BC We consider extensive form games in which players decide on their strategies before the start of play and can purchase noisy information about their opponents' decisions concerning future response...