Related papers: The Determinacy of Context-Free Games
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…
For a graph G, a monotone increasing graph property P and positive integer q, we define the Client-Waiter game to be a two-player game which runs as follows. In each turn Waiter is offering Client a subset of at least one and at most q+1…
Automated verification techniques for stochastic games allow formal reasoning about systems that feature competitive or collaborative behaviour among rational agents in uncertain or probabilistic settings. Existing tools and techniques…
We show that, from a topological point of view, 2-tape B\"uchi automata have the same accepting power than Turing machines equipped with a B\"uchi acceptance condition. In particular, we show that for every non null recursive ordinal alpha,…
We show that standard Bayesian games cannot represent the full spectrum of belief-dependent preferences. However, by introducing a fundamental distinction between intended and actual strategies, we remove this limitation. We define Bayesian…
Direct reciprocity is a mechanism for sustaining mutual cooperation in repeated social dilemma games, where a player would keep cooperation to avoid being retaliated by a co-player in the future. So-called zero-determinant (ZD) strategies…
Tit-for-Tat strategy is a strategy in repeated two-player symmetric games which imitates the previous action of the opponent. We show that the Tit-for-Tat strategy is a zero-determinant strategy, which unilaterally equalizes the expected…
We propose a learning dynamics to model how strategic agents repeatedly play a continuous game while relying on an information platform to learn an unknown payoff-relevant parameter. In each time step, the platform updates a belief estimate…
Subset take-away is a two-player game involving a fixed finite set A. Players alternate choosing a proper, non-empty subset of A, with the condition that one may not name a set containing a set that was named earlier. A player unable to…
We explore the notion of history-determinism in the context of timed automata (TA) over infinite timed words. History-deterministic (HD) automata are those in which nondeterminism can be resolved on the fly, based on the run constructed…
We study the problem of deciding the winner of reachability switching games for zero-, one-, and two-player variants. Switching games provide a deterministic analogue of stochastic games. We show that the zero-player case is NL-hard, the…
Infinite chess is chess played on an infinite edgeless chessboard. The familiar chess pieces move about according to their usual chess rules, and each player strives to place the opposing king into checkmate. The mate-in-n problem of…
Although many game-theoretic models replicate real interactions that often rely on natural language, explicit study of games where language is central to strategic interaction remains limited. This paper introduces the \emph{conversation…
We prove that chess played on the infinite chessboard $\mathbb{Z}^2$ with infinitely many pieces is as powerful as it could possibly be, by showing that every open Gale-Stewart game with draws is strategically equivalent to some infinite…
Hedonic games provide a natural model of coalition formation among self-interested agents. The associated problem of finding stable outcomes in such games has been extensively studied. In this paper, we identify simple conditions on…
We analyze the following version of the deterministic \hats game. We have a graph $G$, and a sage resides at each vertex of $G$. When the game starts, an adversary puts on the head of each sage a hat of a color arbitrarily chosen from a set…
Stochastic games are a convenient formalism for modelling systems that comprise rational agents competing or collaborating within uncertain environments. Probabilistic model checking techniques for this class of models allow us to formally…
The Unique Games Conjecture (UGC) constitutes a highly dynamic subarea within computational complexity theory, intricately linked to the outstanding P versus NP problem. Despite multiple insightful results in the past few years, a proof for…
A nondeterministic automaton is history-deterministic if its nondeterminism can be resolved by only considering the prefix of the word read so far. Due to their good compositional properties, history-deterministic automata are useful in…
We study two-player games of infinite duration that are played on finite or infinite game graphs. A winning strategy for such a game is positional if it only depends on the current position, and not on the history of the play. A game is…