The Parameterized Complexity of Positional Games Edouard Bonnet, Serge Gaspers, Antonin Lambilliotte, Stefan Rümmele, Abdallah Saffidine To cite this version: 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 HAL Id: hal-01994361 https://hal.archives-ouvertes.fr/hal-01994361 Submitted on 25 Jan 2019 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. The Parameterized Complexity of Positional Games Édouard Bonnet1, Serge Gaspers2,3, Antonin Lambilliotte4, Stefan Rümmele5,2, and Abdallah Saffidine2 1 Middlesex University, London, UK
[email protected] 2 The University of New South Wales, Sydney, Australia
[email protected],
[email protected] 3 Data61, CSIRO, Sydney, Australia 4 École Normale Supérieure de Lyon, Lyon, France
[email protected] 5 The University of Sydney, Sydney, Australia
[email protected] Abstract 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.