TL;DR
This paper introduces a new combinatorial game that generalizes Nim and Subtraction, proving that computing Nash equilibrium points in this game is NP-hard, highlighting its computational complexity.
Contribution
It presents a novel game generalizing Nim and Subtraction and establishes NP-hardness of finding Nash equilibria in this game.
Findings
The game generalizes Nim and Subtraction.
Computing Nash equilibria is NP-hard.
The problem's complexity is formally proven.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph Labeling and Dimension Problems · Advanced Algebra and Logic · graph theory and CDMA systems