Related papers: Determinacy of Schmidt's Game and Other Intersecti…
Mean-payoff games are important quantitative models for open reactive systems. They have been widely studied as games of full observation. In this paper we investigate the algorithmic properties of several sub-classes of mean-payoff games…
We consider a setting in which a principal gets to choose which game from some given set is played by a group of agents. The principal would like to choose a game that favors one of the players, the social preferences of the players, or the…
We study 2-player turn-based perfect-information stochastic games with countably infinite state space. The players aim at maximizing/minimizing the probability of a given event (i.e., measurable set of infinite plays), such as reachability,…
Network congestion games are a convenient model for reasoning about routing problems in a network: agents have to move from a source to a target vertex while avoiding congestion, measured as a cost depending on the number of players using…
This compendium features advances in Game Theory, to include: Classical Game Theory: Cooperative and non-cooperative. Zero-sum and non-zero sum games. Potential and Congestion games. Mean Field games. Nash Equilibrium, Correlated Nash…
We consider infinite duration alternating move games. These games were previously studied by Roth, Balcan, Kalai and Mansour. They presented an FPTAS for computing an approximated equilibrium, and conjectured that there is a polynomial…
We introduce an evolutionary game with feedback between perception and reality, which we call the reality game. It is a game of chance in which the probabilities for different objective outcomes (e.g., heads or tails in a coin toss) depend…
Algorithmic game theory (AGT) focuses on the design and analysis of algorithms for interacting agents, with interactions rigorously formalized within the framework of games. Results from AGT find applications in domains such as online…
Combinatorial games lead to several interesting, clean problems in algorithms and complexity theory, many of which remain open. The purpose of this paper is to provide an overview of the area to encourage further research. In particular, we…
In this paper, the known deterministic linear-quadratic Stackelberg game is revisited, whose open-loop Stackelberg solution actually possesses the nature of time inconsistency. To handle this time inconsistency, {a two-tier game framework…
Let $\mathcal{D}=(d_n)_{n=1}^\infty$ be a bounded sequence of integers with $d_n\ge 2$ and let $(i, j)$ be a pair of strictly positive numbers with $i+j=1$. We prove that the set of $x \in \RR$ for which there exists some constant $c(x) >…
We introduce and analyze the ordered Zeckendorf game, a novel combinatorial two-player game inspired by Zeckendorf's Theorem, which guarantees a unique decomposition of every positive integer as a sum of non-consecutive Fibonacci numbers.…
We consider mean field games with discrete state spaces (called discrete mean field games in the following) and we analyze these games in continuous and discrete time, over finite as well as infinite time horizons. We prove the existence of…
This work establishes sufficient conditions for existence of saddle points in discrete Markov games. The result reveals the relation between dynamic games and static games using dynamic programming equations. This result enables us to prove…
Subtraction games are a class of impartial combinatorial games whose positions correspond to nonnegative integers and whose moves correspond to subtracting one of a fixed set of numbers from the current position. Though they are easy to…
We conduct a comprehensive analysis of the discrete-time exponential-weights dynamic with a constant step size on all general-sum and symmetric $2 \times 2$ normal-form games, i.e. games with $2$ pure strategies per player, and where the…
A class of discrete Bidding Combinatorial Games that generalize alternating normal play was introduced by Kant, Larsson, Rai, and Upasany (2022). The major questions concerning optimal outcomes were resolved. By generalizing standard game…
We study mean field games with scalar It{\^o}-type dynamics and costs that are submodular with respect to a suitable order relation on the state and measure space. The submodularity assumption has a number of interesting consequences.…
We prove a game theoretic dichotomy for $G_{\delta\sigma}$ sets of block sequences in vector spaces that extends, on the one hand, the block Ramsey theorem of W. T. Gowers proved for analytic sets of block sequences and, on the other hand,…
We compute equilibrium strategies in multi-stage games with continuous signal and action spaces as they are widely used in the management sciences and economics. Examples include sequential sales via auctions, multi-stage elimination…