Related papers: Mis\`ere Cricket Pitch
We offer some theorems, mainly of finiteness, for certain patterns in elliptical billiards, related to periodic trajectories. For instance, if two players hit a ball at a given position and with directions forming a fixed angle in…
This paper studies the convergence problem for mean field games with common noise. We define a suitable notion of weak mean field equilibria, which we prove captures all subsequential limit points, as $n\to\infty$, of closed-loop…
This paper is a twofold contribution. First, it contributes to the problem of enumerating some classes of simple games and in particular provides the number of weighted games with minimum and the number of weighted games for the dual class…
In this work, we study a triangular variant of the Lights Out game, proposed in the 2025 Capixaba Mathematics Olympiad. We present a combinatorial description of the game, formally characterize its operations, and introduce the notion of a…
A comply/constrain game or a game with a Muller twist is a game where the next player is allowed to place constraints on opponent's next move. We develop a closed form formula for the Grundy value of the single-pile subtraction game where…
We develop the fictitious play algorithm in the context of the linear programming approach for mean field games of optimal stopping and mean field games with regular control and absorption. This algorithm allows to approximate the mean…
Observable games are game situations that reach one of possibly many Nash equilibria. Before an instance of the game starts, an external observer does not know, a priori, what is the exact profile of actions that will occur; thus, he…
We are interested in the study of stochastic games for which each player faces an optimal stopping problem. In our setting, the players may interact through the criterion to optimise as well as through their dynamics. After briefly…
Serious games can teach essential coding and testing concepts even to younger audiences. In the Code Critter game critters execute short snippets of block-based code while traversing the game map, and players position magical portals (akin…
Gimbert and Horn gave an algorithm for solving simple stochastic games with running time O(r! n) where n is the number of positions of the simple stochastic game and r is the number of its coin toss positions. Chatterjee et al. pointed out…
Parity games have important practical applications in formal verification and synthesis, especially to solve the model-checking problem of the modal mu-calculus. They are also interesting from the theory perspective, because they are widely…
We introduce a new, game-theoretic approach to anti-classification results for orbit equivalence relations. Within this framework, we give a short conceptual proof of Hjorth's turbulence theorem. We also introduce a new dynamical criterion…
Sprouts is a two-player topological game, invented in 1967 by Michael Paterson and John Conway. The game starts with p spots, lasts at most 3p-1 moves, and the player who makes the last move wins. In the misere version of Sprouts, on the…
Cricket betting is a multi-billion dollar market. Therefore, there is a strong incentive for models that can predict the outcomes of games and beat the odds provided by bookers. The aim of this study was to investigate to what degree it is…
In this note, we investigate combinatorial games where both players move randomly (each turn, independently selecting a legal move uniformly at random). In this model, we provide closed-form expressions for the expected number of turns in a…
We address the value of a baserunner at first base waiting to see if a ball in play falls in for a hit, before running. When a ball is hit in the air, the baserunner will usually wait, to gather additional information as to whether a ball…
We introduce and study Maker/Breaker-type positional games on random graphs. Our main concern is to determine the threshold probability $p_{F}$ for the existence of Maker's strategy to claim a member of $F$ in the unbiased game played on…
Recent successes of game-theoretic formulations in ML have caused a resurgence of research interest in differentiable games. Overwhelmingly, that research focuses on methods and upper bounds on their speed of convergence. In this work, we…
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…
A special sorting operation called Context Directed Swap, and denoted \textbf{cds}, performs certain types of block interchanges on permutations. When a permutation is sortable by \textbf{cds}, then \textbf{cds} sorts it using the fewest…