DeepAI AI Chat
Log In Sign Up

On the Complexity of Solving Subtraction Games

by   Kamil Khadiev, et al.

We study algorithms for solving Subtraction games, which sometimes are referred to as one-heap Nim games. We describe a quantum algorithm which is applicable to any game on DAG, and show that its query compexity for solving an arbitrary Subtraction game of n stones is O(n^3/2 n). The best known deterministic algorithms for solving such games are based on the dynamic programming approach. We show that this approach is asymptotically optimal and that classical query complexity for solving a Subtraction game is generally Θ(n^2). This paper perhaps is the first explicit "quantum" contribution to algorithmic game theory.


page 1

page 2

page 3

page 4


Quantum-over-classical Advantage in Solving Multiplayer Games

We study the applicability of quantum algorithms in computational game t...

Computational Hardness of Multidimensional Subtraction Games

We study algorithmic complexity of solving subtraction games in a fixed ...

Optimal schemes for combinatorial query problems with integer feedback

A query game is a pair of a set Q of queries and a set ℱ of functions, o...

Gradient Methods for Solving Stackelberg Games

Stackelberg Games are gaining importance in the last years due to the ra...

Polyhedral value iteration for discounted games and energy games

We present a deterministic algorithm, solving discounted games with n no...

Faster Evaluation of Subtraction Games

Subtraction games are played with one or more heaps of tokens, with play...

A Generic Metaheuristic Approach to Sequential Security Games

The paper introduces a generic approach to solving Sequential Security G...