An absorbing game is a repeated game where some action combinations are absorbing, in the sense that whenever they are played, there is a positive probability that the game terminates, and the players receive some terminal payoff at every future stage. We prove that every multi-player absorbing...

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

A celebrated result of Abreu and Rubinstein [1] states that in repeated games, when the players are restricted to playing strategies that can be im- plemented by fnite automata and they have lexicographic preferences, the set of equilibrium payoffs is a strict subset of the set of feasible and...