Skip to Main content Skip to Navigation
New interface
Reports (Research report)

Avoidance games are PSPACE-Complete.

Abstract : Avoidance games are games in which two players claim vertices of a hypergraph and try to avoid some structures. These games are studied since the introduction of the game of SIM in 1968, but only few complexity results are known on them. In 2001, Slany proved some partial results on Avoider-Avoider games complexity, and in 2017 Bonnet et al. proved that short Avoider-Enforcer games are Co-W[1]-hard. More recently, in 2022, Miltzow and Stojakovi\'c proved that these games are NP-hard. As these games corresponds to the mis\`ere version of the well-known Maker-Breaker games, introduced in 1963 and proven PSPACE-complete in 1978, one could expect these games to be PSPACE-complete too, but the question remained open since then. We prove here that both Avoider-Avoider and Avoider-Enforcer conventions are PSPACE-complete, and as a consequence of it that some particular Avoider-Enforcer games also are.
Complete list of metadata
Contributor : Nacim Oijid Connect in order to contact the contributor
Submitted on : Monday, September 26, 2022 - 10:23:34 AM
Last modification on : Saturday, November 5, 2022 - 3:28:04 AM


Files produced by the author(s)


  • HAL Id : hal-03787958, version 1
  • ARXIV : 2209.11698


Valentin Gledel, Nacim Oijid. Avoidance games are PSPACE-Complete.. Umeå Universitet, Umeå, Suède; LIRIS UMR 5205 CNRS/INSA de Lyon/Université Claude Bernard Lyon 1/Université Lumière Lyon 2/École Centrale de Lyon. 2022. ⟨hal-03787958⟩



Record views


Files downloads