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.
翻译:在避险者-强制者游戏中,我们被授予了高射线。 避险者和强制者轮流主张一个无人认领的脊椎, 直到高射线的所有脊椎被主张为止。 如果避险者声称有边缘的所有脊椎, 强制者胜出; 避险者则胜出。 我们证明NP很难决定避险者是否有胜出策略 。