Related papers: Determinacy in Discrete-Bidding Infinite-Duration …
In this paper we introduce polytopal stochastic games, an extension of two-player, zero-sum, turn-based stochastic games, in which we may have uncertainty over the transition probabilities. In these games the uncertainty over the…
The game of war is one of the most popular international children's card games. In the beginning of the game, the pack is split into two parts, then on each move the players reveal their top cards. The player having the highest card…
Repeated game theory has been one of the most prevailing tools for understanding the long-run relationships, which are footstones in building human society. Recent works have revealed a new set of "zero-determinant (ZD)" strategies, which…
The Maker-Breaker domination game (MBD game) is a two-player game played on a graph $G$ by Dominator and Staller. They alternately select unplayed vertices of $G$. The goal of Dominator is to form a dominating set with the set of vertices…
The "War of Attrition" is a classical game theoretic model that was first introduced to mathematically describe certain non-violent animal behavior. The original setup considers two participating players in a one-shot game competing for a…
We prove two determinacy and decidability results about two-players stochastic reachability games with partial observation on both sides and finitely many states, signals and actions.
In decision-dependent games, multiple players optimize their decisions under a data distribution that shifts with their joint actions, creating complex dynamics in applications like market pricing. A practical consequence of these dynamics…
We consider a two player simultaneous-move game where the two players each select any permissible $n$-sided die for a fixed integer $n$. A player wins if the outcome of his roll is greater than that of his opponent. Remarkably, for $n>3$,…
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…
A new class of multi-player competitive stochastic games in discrete-time with an affine specification of the redistribution of payoffs at exercise is proposed and examined. Our games cover as a very special case the classic two-person…
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…
The connected domination game is played just as the domination game, with an additional requirement that at each stage of the game the vertices played induce a connected subgraph. The number of moves in a D-game (an S-game, resp.) on a…
Repeated games have provided an explanation how mutual cooperation can be achieved even if defection is more favorable in a one-shot game in prisoner's dilemma situation. Recently found zero-determinant strategies have substantially been…
We introduce a way to parameterize automata and games on finite graphs with natural numbers. The parameters are accessed essentially by allowing counting down from the parameter value to 0 and branching depending on whether 0 has been…
We introduce a game on graphs. By a theorem of Zermelo, each instance of the game on a finite graph is determined. While the general decision problem on which player has a winning strategy in a given instance of the game is unsolved, we…
Strategic decision-making in uncertain and adversarial environments is crucial for the security of modern systems and infrastructures. A salient feature of many optimal decision-making policies is a level of unpredictability, or randomness,…
Delay games are two-player games of infinite duration in which one player may delay her moves to obtain a lookahead on her opponent's moves. We consider delay games with winning conditions expressed in weak monadic second order logic with…
The relationship between topology and dynamics of complex systems has motivated continuing interest from the scientific community. In the present work, we address this interesting topic from the perspective of simple games, involving two…
Probabilistic timed automata are a suitable formalism to model systems with real-time, nondeterministic and probabilistic behaviour. We study two-player zero-sum games on such automata where the objective of the game is specified as the…
A two-person zero-sum infinite dimensional differential game of infinite duration with discounted payoff involving hybrid controls is studied. The minimizing player is allowed to take continuous, switching and impulse controls whereas the…