Avoider-Enforcer Game is NP-hard

08/13/2022
by   Tillmann Miltzow, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/04/2022

Steiner connectivity problems in hypergraphs

We say that a tree T is an S-Steiner tree if S ⊆ V(T) and a hypergraph i...
research
06/12/2019

Approximating the Orthogonality Dimension of Graphs and Hypergraphs

A t-dimensional orthogonal representation of a hypergraph is an assignme...
research
10/26/2018

HYPE: Massive Hypergraph Partitioning with Neighborhood Expansion

Many important real-world applications-such as social networks or distri...
research
08/29/2018

Short Plane Supports for Spatial Hypergraphs

A graph G=(V,E) is a support of a hypergraph H=(V,S) if every hyperedge ...
research
09/26/2022

Maker-Breaker is solved in polynomial time on hypergraphs of rank 3

In the Maker-Breaker positional game, Maker and Breaker take turns picki...
research
01/15/2022

Zeon and Idem-Clifford Formulations of Hypergraph Problems

Zeon algebras have proven to be useful for enumerating structures in gra...
research
04/02/2021

Independent Sets in Semi-random Hypergraphs

A set of vertices in a hypergraph is called an independent set if no hyp...

Please sign up or login with your details

Forgot password? Click here to reset