Avoider-Enforcer Game is NP-hard
Computational Complexity
2022-11-21 v2 Discrete Mathematics
Data Structures and Algorithms
Computer Science and Game Theory
Combinatorics
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.
Cite
@article{arxiv.2208.06687,
title = {Avoider-Enforcer Game is NP-hard},
author = {Tillmann Miltzow and Miloš Stojaković},
journal= {arXiv preprint arXiv:2208.06687},
year = {2022}
}
Comments
8 pages, 3 figures