Related papers: Thresholds for Tic-Tac-Toe on Finite Affine Spaces

In a pursuit-evasion game, a team of pursuers attempt to capture an evader. The players alternate turns, move with equal speed, and have full information about the state of the game. We consider the most restictive capture condition: a…

Classical objectives in two-player zero-sum games played on graphs often deal with limit behaviors of infinite plays: e.g., mean-payoff and total-payoff in the quantitative setting, or parity in the qualitative one (a canonical way to…

Given two graphs $G$ and $H$, the online Ramsey number $\tilde{r}(G,H)$ is defined to be the minimum number of rounds that Builder can always guarantee a win in the following $(G, H)$-online Ramsey game between Builder and Painter. Starting…

We consider two models of computation for Tarski's order preserving function f related to fixed points in a complete lattice: the oracle function model and the polynomial function model. In both models, we find the first polynomial time…

In a recent arXiv-manuscript Fox studies infinite subtraction games with a finite (ternary) and aperiodic Sprague-Grundy function. Here we provide an elementary example of a game with the given properties, namely the game given by the…

We study the $(m,b)$ Maker-Breaker percolation game on $\mathbb{Z}^2$, introduced by Day and Falgas-Ravry. As our first result, we show that Breaker has a winning strategy for the $(m,b)$-game whenever $b \geq (2-\frac{1}{14} + o(1))m$,…

We study two-player multi-weighted reachability games played on a finite directed graph, where an agent, called P1, has several quantitative reachability objectives that he wants to optimize against an antagonistic environment, called P2.…

We consider two classes of constrained finite state-action stochastic games. First, we consider a two player nonzero sum single controller constrained stochastic game with both average and discounted cost criterion. We consider the same…

We study an impartial achievement game introduced by Anderson and Harary. The game is played by two players who alternately select previously unselected elements of a finite group. The game ends when the jointly selected elements generate…

A new notion of thickness for subsets of $B[0,1]\subset \mathbb{R}^n$ called affine thickness is defined; this notion of thickness is a generalisation of Falconer-Yavicoli thickness and is adapted to be used in the study of certain sets…

We introduce and analyze the ordered Zeckendorf game, a novel combinatorial two-player game inspired by Zeckendorf's Theorem, which guarantees a unique decomposition of every positive integer as a sum of non-consecutive Fibonacci numbers.…

In this paper, the generalized Nash equilibrium (GNE) seeking problem for continuous games with coupled affine inequality constraints is investigated in a partial-decision information scenario, where each player can only access its…

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…

This paper considers the decidability of fully quantum nonlocal games with noisy maximally entangled states. Fully quantum nonlocal games are a generalization of nonlocal games, where both questions and answers are quantum and the referee…

Let $\Lambda$ be an infinite connected graph, and let $v_0$ be a vertex of $\Lambda$. We consider the following positional game. Two players, Maker and Breaker, play in alternating turns. Initially all edges of $\Lambda$ are marked as…

Dynamic games provide a fundamental framework for multi-agent decision-making over time, yet computing feedback Nash equilibria (FNEs) in infinite-horizon discrete-time linear-quadratic (LQ) settings remains computationally challenging.…

In [12] we formulated an evolutionary game theory model as a dynamical system on the state space of finite signed Borel measures under the weak* topology. The focus of this paper is to extend the analysis to include the long-time behavior…

An extensive literature in economics and social science addresses contests, in which players compete to outperform each other on some measurable criterion, often referred to as a player's score, or output. Players incur costs that are an…

Let $W$ denote the $n$-dimensional affine space over the finite field $\mathbb F_q$. We prove here a Bollob\'as-type upper bound in the case of the set of affine subspaces. We give a construction of a pair of families of affine subspaces,…

The $q$-round Renyi-Ulam pathological liar game with $k$ lies on the set $[n]:=\{1,...,n\}$ is a 2-player perfect information zero sum game. In each round Paul chooses a subset $A\subseteq [n]$ and Carole either assigns 1 lie to each…