Avoider-Enforcer Game is NP-hard
Tillmann Miltzow, Miloš Stojaković · arXiv (Cornell University) · 2022
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.