Avoider-Enforcer Game is NP-hard
Publication date
2022
Authors
Miltzow, Till
Stojakovic, Milos
Editors
Advisors
Supervisors
Document Type
/dk/atira/pure/researchoutput/researchoutputtypes/workingpaper/preprint
Metadata
Show full item recordCollections
License
cc_by
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.
Keywords
Citation
Miltzow, T & Stojakovic, M 2022 'Avoider-Enforcer Game is NP-hard' arXiv, pp. 1-8. https://doi.org/10.48550/arXiv.2208.06687