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

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>

A general communication device is a device that at every stage of the game receives a private message from each player, and in return sends a private signal to each player; the signals the device sends depend on past play, past signals it sent, and past messages it received. <p> An autonomous...</p>

We study finite zero-sum stochastic games in which players do not observe the actions of their opponent. Rather, at each stage, each player observes a stochastic signal that may depend on the current state and on the pair of actions chosen by the players. We assume that each player observes the...

We introduce the concept of -consistent equilibrium where each player plays a -best response after every history reached with positive probability. In particular, an -consistent equilibrium induces an -equilibrium in any subgame reached along the play path. The existence of -consistent...

The notion of mediated talk in which players communicate through a mediator before starting the game is introduced. It shows that a deterministic mechanized mediator receiving private inputs and producing public outputs can generate any rational correlated equilibrium with rational probabilities...

This note studies relations between lim "V [subscript n]" and the lower long-run average value ("V" [underlined]) in dynamic programming. It is shown that a certain bounded variation conditions of {"V [subscript n]} implies that lim "V [subscript n] [is equal to] "V" [underlined].