The Parameterized Complexity of Positional Games - 11e Journées d'Intelligence Artificielle Fondamentale Accéder directement au contenu
Communication Dans Un Congrès Année : 2017

The Parameterized Complexity of Positional Games

Edouard Bonnet
Serge Gaspers
  • Fonction : Auteur
  • PersonId : 971752
Antonin Lambilliotte
  • Fonction : Auteur
  • PersonId : 1042075
Stefan Rümmele
  • Fonction : Auteur
Abdallah Saffidine
  • Fonction : Auteur

Résumé

We study the parameterized complexity of several positional games. Our main result is that Short Generalized Hex is W[1]-complete parameterized by the number of moves. This solves an open problem from Downey and Fellows' influential list of open problems from 1999. Previously , the problem was thought of as a natural candidate for AW[*]-completeness. Our main tool is a new fragment of first-order logic where universally quantified variables only occur in inequalities. We show that model-checking on arbitrary relational structures for a formula in this fragment is W[1]-complete when parameterized by formula size. We also consider a general framework where a positional game is represented as a hypergraph and two players alternately pick vertices. In a Maker-Maker game, the first player to have picked all the vertices of some hyperedge wins the game. In a Maker-Breaker game, the first player wins if she picks all the vertices of some hyperedge, and the second player wins otherwise. In an Enforcer-Avoider game, the first player wins if the second player picks all the vertices of some hyperedge, and the second player wins otherwise. Short Maker-Maker is AW[*]-complete, whereas Short Maker-Breaker is W[1] and Short Enforcer-Avoider co-W[1]-complete parameterized by the number of moves. This suggests a rough parameterized complexity categorization into positional games that are complete for the first level of the W-hierarchy when the winning configurations only depend on which vertices one player has been able to pick, but AW[*]-completeness when the winning condition depends on which vertices both players have picked. However, some positional games where the board and the winning configurations are highly structured are fixed-parameter tractable. We give another example of such a game, Short k-Connect, which is fixed-parameter tractable when parameterized by the number of moves.
Fichier principal
Vignette du fichier
short-positional-games.pdf (583.76 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01994361 , version 1 (25-01-2019)

Identifiants

Citer

Edouard Bonnet, Serge Gaspers, Antonin Lambilliotte, Stefan Rümmele, Abdallah Saffidine. The Parameterized Complexity of Positional Games. ICALP, Jul 2017, Varsovie, Poland. ⟨10.4230/LIPIcs⟩. ⟨hal-01994361⟩

Collections

ENS-LYON IAF17 UDL
133 Consultations
62 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More