An NP-hard generalization of Nim
Abstract
A new combinatorial game is given. It generalizes both Substraction and Nim. It is proved the computation of Nash equilibrium points in this new game is NP-hard.
- Publication:
-
arXiv e-prints
- Pub Date:
- August 2024
- DOI:
- 10.48550/arXiv.2408.13834
- arXiv:
- arXiv:2408.13834
- Bibcode:
- 2024arXiv240813834L
- Keywords:
-
- Computer Science - Computer Science and Game Theory;
- Mathematics - Combinatorics