We address the question of existence of equilibrium in general timing games with complete information. Under weak assumptions, any two-player timing game has a Markov subgame perfect e-equilibrium, for each e40: This result is tight. For some classes of games (symmetric games, games with cumulative payoffs), stronger existence results are established. r 2004 Elsevier Inc. All rights reserved. J...

We study a two-player, zero-sum, stochastic game with incomplete information on one side in which the players are allowed to play more and more frequently. The informed player observes the realization of a Markov chain on which the payoffs depend, while the non-informed player only observes his opponent’s actions. We show the existence of a limit value as the time span between two consecutive s...

We study a two-player, zero-sum, stochastic game with incomplete information on one side in which the players are allowed to play more and more frequently. The informed player observes the realization of a Markov chain on which the payoffs depend, while the non-informed player only observes his opponent’s actions. We show the existence of a limit value as the time span between two consecutive s...

In this paper we present a novel generic mapping between Graphical Games and Markov Random Fields so that pure Nash equilibria in the former can be found by statistical inference on the latter. Thus, the problem of deciding whether a graphical game has a pure Nash equilibrium, a well-known intractable problem, can be attacked by well-established algorithms such as Belief Propagation, Junction T...

We study a class of infinite horizon stochastic games with uncountable number of states. We first characterize the set of all (nonstationary) short-term (Markovian) equilibrium values by developing a new Abreu, Pearce, and Stacchetti (1990) type procedure operating in function spaces. This (among others) proofs Markov Perfect Nash Equilibrium (MPNE) existence. Moreover, we present techniques of...

We propose two related equilibrium re…nements for voting and agenda-setting games, Sequentially Weakly Undominated Equilibrium (SWUE) and Markov Trembling Hand Perfect Equilibrium (MTHPE), and show how these equilibrium concepts eliminate non-intuitive equilibria that arise naturally in dynamic voting games and games in which random or deterministic sequences of agenda-setters make o¤ers to sev...