Related papers: Diagonalization Games
A body moves in a medium composed of noninteracting point particles; interaction of particles with the body is absolutely elastic. It is required to find the body's shape minimizing or maximizing resistance of the medium to its motion. This…
The numbers game is a one-player game played on a finite simple graph with certain "amplitudes" assigned to its edges and with an initial assignment of real numbers to its nodes. The moves of the game successively transform the numbers at…
The performance of two pivoting algorithms, due to Lemke and Cottle and Dantzig, is studied on linear complementarity problems (LCPs) that arise from infinite games, such as parity, average-reward, and discounted games. The algorithms have…
Zeckendorf proved that every positive integer can be written uniquely as the sum of non-adjacent Fibonacci numbers. We further explore a two-player Zeckendorf game introduced in Baird-Smith, Epstein, Flint, and Miller: Given a fixed integer…
Consider the following Maker-Breaker type game played by Toucher and Isolator on the edges of a graph $G$ with first move given to Toucher. The aim of Isolator is to maximise the number of vertices which are not incident to any edges…
In the Constructor-Blocker game, two players, Constructor and Blocker, alternatively claim unclaimed edges of the complete graph $K_n$. For given graphs $F$ and $H$, Constructor can only claim edges that leave her graph $F$-free, while…
In dynamic noncooperative games, each player makes conjectures about other players' reactions before choosing a strategy. However, resulting equilibria may be multiple and do not always lead to desirable outcomes. These issues are typically…
This paper addresses several significant gaps in the theory of restricted mis\`ere play (Plambeck, Siegel 2008), primarily in the well-studied universe of dead-ending games, $\mathcal{E}$ (Milley, Renault 2013); if a player run out of moves…
Let $G=(V,E)$ be a connected undirected graph with $k$ vertices. Suppose that on each vertex of the graph there is a player having an $n$-bit string. Each player is allowed to communicate with its neighbors according to an agreed…
For a finite set $X$, a family of sets ${\mathcal F} \subseteq 2^X$ and a positive integer $q$, we consider two types of two player, perfect information games with no chance moves. In each round of the $(1 : q)$ Waiter-Client game $(X,…
The minmax regret problem for combinatorial optimization under uncertainty can be viewed as a zero-sum game played between an optimizing player and an adversary, where the optimizing player selects a solution and the adversary selects costs…
We investigate game-theoretic variants of cardinal invariants of the continuum. The invariants we treat are the reaping number $\mathfrak{r}$, the bounding number $\mathfrak{b}$, the dominating number $\mathfrak{d}$, and the additivity…
We consider the problem of maximizing the minimum (weighted) value of all components of a vector over a polymatroid. This is a special case of the lexicographically optimal base problem introduced and solved by Fujishige. We give an…
For positive integers $n$ and $q$ and a monotone graph property $\cA$, we consider the two player, perfect information game $\WC(n,q,\cA)$, which is defined as follows. The game proceeds in rounds. In each round, the first player, called…
Independent learners are agents that employ single-agent algorithms in multi-agent systems, intentionally ignoring the effect of other strategic agents. This paper studies mean-field games from a decentralized learning perspective, with two…
In this paper we describe a strategy for Dominator that finishes the total domination game in at most $3/4n$ moves for every graph $G$ on $n$ vertices without any isolated vertices or edges, confirming the 3/4-conjecture for the total…
The $(m,n)$-online Ramsey game is a combinatorial game between two players, Builder and Painter. Starting from an infinite set of isolated vertices, Builder draws an edge on each turn and Painter immediately paints it red or blue. Builder's…
Kingdomino is introduced as an interesting game for studying game playing: the game is multiplayer (4 independent players per game); it has a limited game depth (13 moves per player); and it has limited but not insignificant interaction…
We introduce a graph Ramsey game called Ramsey, Paper, Scissors. This game has two players, Proposer and Decider. Starting from an empty graph on $n$ vertices, on each turn Proposer proposes a potential edge and Decider simultaneously…
This paper establishes the tractability of finding the optimal Nash equilibrium, as well as the optimal social solution, to a discrete congestion game using a gate-model quantum computer. The game is of the type originally posited by…