2000 character limit reached
Avoider-Enforcer Game is NP-hard (2208.06687v2)
Published 13 Aug 2022 in cs.CC, cs.DM, cs.DS, cs.GT, and math.CO
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.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.