Related papers: Mixed-Radix Nim
Nim is a well-known combinatorial game in which two players alternately remove stones from distinct piles. A player who removes the last stone wins under the normal play rule, while a player loses under the mis\`ere play rule. In this…
Node-Kayles is a well-known impartial combinatorial game played on graphs, where players alternately select a vertex and remove it along with its neighbors. By the Sprague-Grundy theorem, every position of an impartial game corresponds to a…
We consider the repeated prisoner's dilemma (PD). We assume that players make their choices knowing only average payoffs from the previous stages. A player's strategy is a function from the convex hull $\mathfrak{S}$ of the set of payoffs…
In this paper we obtain sufficient and necessary conditions on the number of samples required for exact recovery of the pure-strategy Nash equilibria (PSNE) set of a graphical game from noisy observations of joint actions. We consider…
Every positive integer may be written uniquely as a base-$\beta$ decomposition--that is a legal sum of powers of $\beta$--where $\beta$ is the dominating root of a non-increasing positive linear recurrence sequence. Guided by earlier work…
We obtain bounds for the number of variables required to establish Hasse principles, both for existence of solutions and for asymptotic formulae, for systems of additive equations containing forms of differing degree but also multiple forms…
This paper is devoted to some qualitative descriptions and some numerical results for ergodic Mean Field Games systems which arise, e.g., in the homogenization with a small noise limit. We shall consider either power type potentials or…
The celebrated Krusel-Smith growth model is an important example of a Mean Field Game with a common noise. The Mean Field Game is encoded in the master equation, a partial differential equation satisfied by the value of the game which…
We investigate the existence of classical solutions to second-order quadratic Mean-Field Games systems with local and strongly decreasing couplings of the form $-\sigma m^\alpha$, $\alpha \ge 2/N$, where $m$ is the population density and…
Wythoff's Game is a variation of Nim in which players may take an equal number of stones from each pile or make valid Nim moves. W. A. Wythoff proved that the set of P-Positions (losing position), $C$, for Wythoff's Game is given by $C :=…
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 paper, we consider the stationary version of the Mean-Field Games (MFG) models. Inspired by \cite{Albuquerque-Silva2020, Bieganowski-Mederski2021, Lin-Wei05, Mederski-Schino2021}, we develop the minimization method on the Pohozaev…
The game of Nim, which has been well known for many years, has numerous variations. One such variation is Circular Nim, where piles of stones are arranged on a circumference, and players take stones from consecutive adjacent piles in one…
We consider positional numeration systems with negative real base $-\beta$, where $\beta>1$, and study the extremal representations in these systems, called here the greedy and lazy representations. We give algorithms for determination of…
In this paper, we study nonzero-sum separable games, which are continuous games whose payoffs take a sum-of-products form. Included in this subclass are all finite games and polynomial games. We investigate the structure of equilibria in…
We study how risk-sensitive players act in situations where the outcome is influenced not only by the state-action profile but also by the distribution of it. In such interactive decision-making problems, the classical mean-field game…
In this paper,we consider the restless bandit problem, which is one of the most well-studied generalizations of the celebrated stochastic multi-armed bandit problem in decision theory. However, it is known be PSPACE-Hard to approximate to…
The ordinary game of Nim has a long history and is well-known in the area of combinatorial game theory. The solution to the ordinary game of Nim has been known for many years and lends itself to numerous other solutions to combinatorial…
We study the applicability of quantum algorithms in computational game theory and generalize some results related to Subtraction games, which are sometimes referred to as one-heap Nim games. In quantum game theory, a subset of Subtraction…
In this paper, we introduce a variant of Francis Su's "Game of Cycles," that we call "Cycles with Sources." The only change to the rules is permitting nodes to be sources, while sinks are still prohibited. Despite this minor change in the…