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 show how a stochastic variation of a Ramsey's theorem can be used to prove the existence of the value, and to construct [var epsilon]-optimal strategies, in two-player zero-sum dynamic games that have certain properties.

Every finite extensive-form game with perfect information has a subgame-perfect equilibrium. In this note we settle to the negative an open problem regarding the existence of a subgame-perfect <InlineEquation ID="IEq4"> <EquationSource Format="TEX">$$\varepsilon $$</EquationSource> <EquationSource Format="MATHML"> <math xmlns:xlink="http://www.w3.org/1999/xlink"> <mi mathvariant="italic">ε</mi> </math> </EquationSource> </InlineEquation>-equilibrium in perfect information games with infinite horizon and Borel...</equationsource></equationsource></inlineequation>

We study a selection game between two committee members (the players). They interview candidates sequentially and have to decide, after each interview, whether to hire the candidate or to interview the next candidate. Each player can either accept or reject the candidate, and if he rejects the...

We prove that every two-player nonzero-sum Dynkin game in continuous time admits an "epsilon" equilibrium in randomized stopping times. We provide a condition that ensures the existence of an "epsilon" equilibrium in nonrandomized stopping times.