Thesis of Nacim Oijid


Subject:
Complexity of positional games on graphs

Start date: 01/09/2021
End date (estimated): 01/09/2024

Advisor: Eric Duchene
Coadvisor: Aline Parreau

Summary:

The thesis investigates the theme of positional games, introduced by Erdos in the 1970s. In particular, three lines of research will be explored

- particular structures of hypergraphs for the game board
- the study of bridges between different winning conventions (maker-maker, maker-breaker, picker-chooser, avoider-enforcer)
- the study of parameterized complexity


Jury:
M. LAMPIS MichaelMaître de conférenceUniversité Paris Dauphine UMR 7243 - LAMSADERapporteur(e)
M. TODINCA IoanProfesseur(e)Université d’Orléans UR 4022 - LIFORapporteur(e)
M. DEMAINE ErikProfesseur(e)Université de Massachusetts Cambridge (Etats Unis)Examinateur​(trice)
DUCHENE EricProfesseur(e)Université Lyon 1 UMR 5205 - LIRISDirecteur(trice) de thèse
Mme. GUERIN LASSOUS IsabelleProfesseur(e)Université Lyon 1 UMR 5668 - LIPExaminateur​(trice)
Mme. PARREAU AlineChargé(e) de RechercheCNRS Lyon UMR 5205 - LIRISEncadrant(e)