Related papers: Multiplayer Games of War
Two-player (antagonistic) games on (possibly stochastic) graphs are a prevalent model in theoretical computer science, notably as a framework for reactive synthesis. Optimal strategies may require randomisation when dealing with inherently…
Simple stochastic games are turn-based 2.5-player games with a reachability objective. The basic question asks whether one player can ensure reaching a given target with at least a given probability. A natural extension is games with a…
This paper deals with a standard stochastic game model with a continuum of states under the duel-type setup. It newly proposes a hybrid model of game theory and the fluctuation process, which could be applied for various practical decision…
We introduce consumption games, a model for discrete interactive system with multiple resources that are consumed or reloaded independently. More precisely, a consumption game is a finite-state graph where each transition is labeled by a…
This paper contains a reformulation of any $n$-player finite, static game into a framework of distributed, dynamical system based on agents' payoff-based deviations. The reformulation generalizes the method employed in the second part of…
In general, Nash equilibria in normal-form games may require players to play (probabilistically) mixed strategies. We define a measure of the complexity of finite probability distributions and study the complexity required to play Nash…
We consider two-player games over graphs and give tight bounds on the memory size of strategies ensuring safety objectives. More specifically, we show that the minimal number of memory states of a strategy ensuring a safety objective is…
In this paper, we study one-player and two-player energy mean-payoff games. Energy mean-payoff games are games of infinite duration played on a finite graph with edges labeled by 2-dimensional weight vectors. The objective of the first…
We construct a model of strategic imitation in an arbitrary network of players who interact through an additive game. Assuming a discrete time update, we show a condition under which the resulting difference equations converge to consensus.…
In this paper we study the nonzero-sum Dynkin game in continuous time which is a two player non-cooperative game on stopping times. We show that it has a Nash equilibrium point for general stochastic processes. As an application, we…
We study the asymptotic organization among many optimizing individuals interacting in a suitable "moderate" way. We justify this limiting game by proving that its solution provides approximate Nash equilibria for large but finite player…
Negotiations, a model of concurrency with multi party negotiation as primitive, have been recently introduced in arXiv:1307.2145, arXiv:1403.4958. We initiate the study of games for this model. We study coalition problems: can a given…
Two concepts of random stopping times in continuous time have been defined in the literature, mixed stopping times and randomized stopping times. We show that under weak conditions these two concepts are equivalent, and, in fact, that all…
The domination game is an optimization game played by two players, Dominator and Staller, who alternately select vertices in a graph $G$. A vertex is said to be dominated if it has been selected or is adjacent to a selected vertex. Each…
Infinite games where several players seek to coordinate under imperfect information are deemed to be undecidable, unless the information is hierarchically ordered among the players. We identify a class of games for which joint winning…
In this article, we consider mean field games between a dominating player and a group of representative agents, each of which acts similarly and also interacts with each other through a mean field term being substantially influenced by the…
We construct a diffusion approximation of a repeated game in which agents make bets on outcomes of i.i.d. random vectors and their strategies are close to an asymptotically optimal strategy. This model can be interpreted as trading in an…
Partial order reductions have been successfully applied to model checking of concurrent systems and practical applications of the technique show nontrivial reduction in the size of the explored state space. We present a theory of partial…
A single-player game of Memory is played with $n$ distinct pairs of cards, with the cards in each pair bearing identical pictures. The cards are laid face-down. A move consists of revealing two cards, chosen adaptively. If these cards…
We consider multi-player games played on graphs, in which the players aim at fulfilling their own (not necessarily antagonistic) objectives. In the spirit of evolutionary game theory, we suppose that the players have the right to repeatedly…