相关论文: Additive Subtraction Games

Circular nim $CN(m, k)$ is a variant of nim, in which there are $m$ piles of tokens arranged in a circle and each player, in their turn, chooses at most $k$ consecutive piles in the circle and removes an arbitrary number of tokens from each…

We define and give results on the game NecklaceNim NN($n$,$k$) which is PathNim PN($n$,$k$) with an additional move allowed on the end vertices. This game arises as a sub-game in the context of solving CircularNim CN($n$,$k$) when $k-2$…

The primal-dual active set method is observed to be the limit of a sequence of penalty formulations. Using this perspective, we propose a penalty method that adaptively becomes the active set method as the residual of the iterate decreases.…

We encode arbitrary finite impartial combinatorial games in terms of lattice points in rational convex polyhedra. Encodings provided by these \emph{lattice games} can be made particularly efficient for octal games, which we generalize to…

Recent advances in quantum computing and in particular, the introduction of quantum GANs, have led to increased interest in quantum zero-sum game theory, extending the scope of learning algorithms for classical games into the quantum realm.…

We address the numerical solution of second-order Mean Field Game problems through Newton iterations in infinite dimensions, introduced in [14], where quadratic convergence of the method was rigorously established. Building upon this…

Combinatorial games played between two players, called Spoiler and Duplicator, have often been used to capture syntactic properties of formal logical languages. For instance, the widely used Ehrenfeucht-Fra\"iss\'e (EF) game captures the…

We investigate conditions under which positions in combinatorial games admit simple values. We introduce a unified diamond framework, the $\Diamond_A$-property ($A\in\{\mathbb{Z},\mathbb{D}$), for sets of positions closed under options.…

This paper presents a case study for the application of semiring semantics for fixed-point formulae to the analysis of strategies in B\"uchi games. Semiring semantics generalizes the classical Boolean semantics by permitting multiple truth…

Periodic orbit theory for classical hyperbolic system is very significant matter of how we can interpret spectral statistics in terms of semiclassical theory. Although pruning is significant and generic property for almost all hyperbolic…

Mis\`ere games in general have little algebraic structure, but if the games under consideration have properties then some algebraic structure re-appears. In 2023, the class of Blocking games was identified. Mis\`ere Cricket Pitch was…

This paper studies a one-dimensional Mean-Field Planning (MFP) system with a non-local, rank-based coupling. Using a potential formulation, we rewrite the system as an associated scalar partial differential equation. We prove an equivalence…

Stochastic games are a classical model in game theory in which two opponents interact and the environment changes in response to the players' behavior. The central solution concepts for these games are the discounted values and the value,…

We develop a theory of complexity for numerical computations that takes into account the condition of the input data and allows for roundoff in the computations. We follow the lines of the theory developed by Blum, Shub, and Smale for…

\textsc{cut} is a class of partition games played on a finite number of finite piles of tokens. Each version of \textsc{cut} is specified by a cut-set $\mathcal{C}\subseteq\mathbb{N}$. A legal move consists of selecting one of the piles and…

Ye showed recently that the simplex method with Dantzig pivoting rule, as well as Howard's policy iteration algorithm, solve discounted Markov decision processes (MDPs), with a constant discount factor, in strongly polynomial time. More…

We study the complexity of computing stationary Nash equilibrium (NE) in n-player infinite-horizon general-sum stochastic games. We focus on the problem of computing NE in such stochastic games when each player is restricted to choosing a…

Convex quadratic programs (QPs) constitute a fundamental computational primitive across diverse domains including financial optimization, control systems, and machine learning. The alternating direction method of multipliers (ADMM) has…

In this thesis, we settle the computational complexity of some fundamental questions in polynomial optimization. These include the questions of (i) finding a local minimum, (ii) testing local minimality of a point, and (iii) deciding…

We introduce and study a discrete multi-period extension of the classical knapsack problem, dubbed generalized incremental knapsack. In this setting, we are given a set of $n$ items, each associated with a non-negative weight, and $T$ time…