相关论文: Uniform Value for Recursive Games with Compact Act…

We consider a class of Mean Field Games in which the agents may interact through the statistical distribution of their states and controls. It is supposed that the Hamiltonian behaves like a power of its arguments as they tend to infinity,…

Combinatorial game theory (CGT), as introduced by Berlekamp, Conway and Guy, involves two players who move alternately in a perfect information, zero-sum game, and there are no chance devices. Also the games have the finite descent property…

We study a class of two-player zero-sum stochastic games known as \textit{blind stochastic games}, where players neither observe the state nor receive any information about it during the game. A central concept for analyzing long-duration…

We introduce quantitative reductions, a novel technique for structuring the space of quantitative games and solving them that does not rely on a reduction to qualitative games. We show that such reductions exhibit the same desirable…

We propose a unifying additive theory for standard conventions in Combinatorial Game Theory, including normal-, mis\`ere- and scoring-play, studied by Berlekamp, Conway, Dorbec, Ettinger, Guy, Larsson, Milley, Neto, Nowakowski, Renault,…

We prove that every repeated game with countably many players, finite action sets, and tail-measurable payoffs admits an $\epsilon$-equilibrium, for every $\epsilon > 0$.

McLennan and Tourky (2010) showed that "imitation games" provide a new view of the computation of Nash equilibria of bimatrix games with the Lemke-Howson algorithm. In an imitation game, the payoff matrix of one of the players is the…

This paper extends Berge's maximum theorem for possibly noncompact action sets and unbounded cost functions to minimax problems and studies applications of these extensions to two-player zero-sum games with possibly noncompact action sets…

Zero-sum stochastic games generalize the notion of Markov Decision Processes (i.e. controlled Markov chains, or stochastic dynamic programming) to the 2-player competitive case : two players jointly control the evolution of a state…

A uniform sunspot epsilon-equilibrium of a dynamic game is a uniform epsilon-equilibrium in an extended game, where the players observe a public signal at every stage. We prove that a uniform sunspot epsilon-equilibrium exists in two…

A combinatorial game is a two-player game without hidden information or chance elements. One of the major approaches to analyzing games in combinatorial game theory is to break down a given game position into a disjunctive sum of multiple…

We consider two-player stochastic games played on a finite state space for an infinite number of rounds. The games are concurrent: in each round, the two players (player 1 and player 2) choose their moves independently and simultaneously;…

We begin by reviewing and proving the basic facts of combinatorial game theory. We then consider scoring games (also known as Milnor games or positional games), focusing on the "fixed-length" games for which all sequences of play terminate…

We state and prove Kuhn's equivalence theorem for a new representation of games, the intrinsic form. First, we introduce games in intrinsic form where information is represented by $\sigma$-fields over a product set. For this purpose, we…

This paper presents a universal representation of symmetric (permutation-invariant) functions with multidimensional variable-size variables. These representations help justify approximation methods that aggregate information from each…

The paper is devoted to inverse Stackelberg games with many players. We consider both static and differential games. The main assumption of the paper is the compactness of the strategy sets. We obtain the characterization of inverse…

This paper presents a general existence and uniqueness result for mean field games equations on graphs ($\mathcal{G}$-MFG). In particular, our setting allows to take into account congestion effects of almost any form. These general…

We study turn-based quantitative games of infinite duration opposing two antagonistic players and played over graphs. This model is widely accepted as providing the adequate framework for formalizing the synthesis question for reactive…

A seminal result in game theory is von Neumann's minmax theorem, which states that zero-sum games admit an essentially unique equilibrium solution. Classical learning results build on this theorem to show that online no-regret dynamics…

We study infinitely repeated games in settings of imperfect monitoring. We first prove a family of theorems that show that when the signals observed by the players satisfy a condition known as $(\epsilon, \gamma)$-differential privacy, that…