Avoider-Enforcer Game is NP-hard
Abstract
In an Avoider-Enforcer game, we are given a hypergraph. Avoider and Enforcer alternate in claiming an unclaimed vertex, until all the vertices of the hypergraph are claimed. Enforcer wins if Avoider claims all vertices of an edge; Avoider wins otherwise. We show that it is NP-hard to decide if Avoider has a winning strategy.
- Publication:
-
arXiv e-prints
- Pub Date:
- August 2022
- DOI:
- 10.48550/arXiv.2208.06687
- arXiv:
- arXiv:2208.06687
- Bibcode:
- 2022arXiv220806687M
- Keywords:
-
- Computer Science - Computational Complexity;
- Computer Science - Discrete Mathematics;
- Computer Science - Data Structures and Algorithms;
- Computer Science - Computer Science and Game Theory;
- Mathematics - Combinatorics
- E-Print:
- 8 pages, 3 figures