Related papers: Playing odds and evens with finite automata
This paper studies the equilibrium properties of the ``obvious strategy profile'' in large finite-player games. Each player in such a strategy profile simply adopts a randomized strategy as she would have used in a symmetric equilibrium of…
We present a deterministic algorithm, solving discounted games with $n$ nodes in $n^{O(1)}\cdot (2 + \sqrt{2})^n$-time. For bipartite discounted games our algorithm runs in $n^{O(1)}\cdot 2^n$-time. Prior to our work no deterministic…
Mean Field Games with state constraints are differential games with infinitely many agents, each agent facing a constraint on his state. The aim of this paper is to provide a meaning of the PDE system associated with these games, the…
Stochastic games are often used to model reactive processes. We consider the problem of synthesizing an optimal almost-sure winning strategy in a two-player (namely a system and its environment) turn-based stochastic game with both a…
We introduce a new setting where a population of agents, each modelled by a finite-state system, are controlled uniformly: the controller applies the same action to every agent. The framework is largely inspired by the control of a…
Apportionment is the problem of distributing $h$ indivisible seats across states in proportion to the states' populations. In the context of the US House of Representatives, this problem has a rich history and is a prime example of…
We prove that in a general zero-sum repeated game where the first player is more informed than the second player and controls the evolution of information on the state, the uniform value exists. This result extends previous results on…
Two-player zero-sum repeated games are well understood. Computing the value of such a game is straightforward. Additionally, if the payoffs are dependent on a random state of the game known to one, both, or neither of the players, the…
We verify a conjecture of Nowakowski and Ottaway that closed $1 \times n$ Dots-and-Triangles is a first-player win when $n \neq 2$. We also prove that in both the open and closed $1 \times n$ Dots-and-Boxes games where $n$ is even, the…
We study a version of the minority game in which one agent is allowed to join the game in a random fashion. It is shown that in the crowded regime, i.e., for small values of the memory size $m$ of the agents in the population, the agent…
We study the asymptotic behavior of the ratio of total return (or total profit) to total amount bet in a casino game. While the limit is well understood when the sequence of wagers is independent and identically distributed, here we…
Penney's game is a two player zero-sum game in which each player chooses a three-flip pattern of heads and tails and the winner is the player whose pattern occurs first in repeated tosses of a fair coin. Because the players choose…
We describe a uniform construction for converting $\omega$-automata with arbitrary acceptance conditions (based on the notion of infinity sets i.e. the set of states visited infinitely often in a run of the automaton) to equivalent…
We give an alternative proof that every two-person non-zero-sum absorbing positive recursive stochastic game with finitely many states has approximate equilibria, a result proven by Nicolas Vieille. Our proof uses a state specific discount…
In the planar one-round discrete Voronoi game, two players $\mathcal{P}$ and $\mathcal{Q}$ compete over a set $V$ of $n$ voters represented by points in $\mathbb{R}^2$. First, $\mathcal{P}$ places a set $P$ of $k$ points, then $\mathcal{Q}$…
We proved that any even number not less than 6 can be expressed as the sum of two old primes, $2n=p_i+p_j$
Von Neumann's Min-Max Theorem guarantees that each player of a zero-sum matrix game has an optimal mixed strategy. This paper gives an elementary proof that each player has a near-optimal mixed strategy that chooses uniformly at random from…
Recently, in [K.R. Apt and S. Simon: Well-founded extensive games with perfect information, TARK21], we studied well-founded games, a natural extension of finite extensive games with perfect information in which all plays are finite. We…
This paper proves several Tauberian theorems for general iterations of operators, and provides two applications to zero-sum stochastic games where the total payoff is a weighted sum of the stage payoffs. The first application is to provide…
In the Penney-Ante game, Player I chooses a head/tail string of a predetermined length $n\ge3$. Player II, upon seeing Player I's choice, chooses another head/tail string of the same length. A coin is then tossed repeatedly and the player…