An NP-hard generalization of Nim
Fuente:
arXiv
Enregistré dans:
| Auteur principal: | |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866916369402953728 |
|---|---|
| author | Liu, Chunlei |
| author_facet | Liu, Chunlei |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2408_13834 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | An NP-hard generalization of Nim Liu, Chunlei Computer Science and Game Theory Combinatorics 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. |
| title | An NP-hard generalization of Nim |
| topic | Computer Science and Game Theory Combinatorics |
| url | https://arxiv.org/abs/2408.13834 |