Avoider-Enforcer Game is NP-hard
From MaRDI portal
Publication:6407785
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.
This page was built for publication: Avoider-Enforcer Game is NP-hard
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6407785)
