BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//labri.fr//NONSGML kigkonsult.se iCalcreator 2.41.92//
CALSCALE:GREGORIAN
METHOD:PUBLISH
UID:eaa0272c-daef-473b-ac90-5a639a2dc249
X-WR-CALNAME:[gt.go] - 'On the complexity of positional games' by Nacim Oij
 id
X-WR-TIMEZONE:Europe/Paris
BEGIN:VTIMEZONE
TZID:Europe/Paris
TZUNTIL:20260329T010000Z
BEGIN:STANDARD
TZNAME:CET
DTSTART:20231029T030000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
RDATE:20241027T030000
RDATE:20251026T030000
END:STANDARD
BEGIN:DAYLIGHT
TZNAME:CEST
DTSTART:20240331T020000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
RDATE:20250330T020000
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:eaa0272c-daef-473b-ac90-5a639a2dc249
DTSTAMP:20260929T085034Z
CLASS:PUBLIC
DESCRIPTION:/Exposé /Talk/ \n\nPositional games were introduced by Hales an
 d Jewett in 1963. They are usually played on a hypergraph\, and two player
 s take turns claiming the vertices of the hypergraph until a hyperedge is 
 filled up by one player. When this happens\, the winning conditions depend
  on the convention played. The most studied convention\, Maker-Breaker\, i
 s played on a hypergraph by two players: Maker and Breaker. Maker wins if 
 she manages to claim all the vertices of a hyperedge\, otherwise Breaker w
 ins. This convention was proved PSPACE-complete by Schaefer in 1978\, for 
 hypergraphs of rank 11\, and this result was improved in 2023 by Rahman an
 d Watson for hypergraphs of rank 6. \n\nIn this talk\, we will present thr
 ee other positional game conventions\, namely Avoider-Enforcer\, Client-Wa
 iter and Waiter-Client\, together with the proof of the PSPACE-completenes
 s of the first two\, and the tractability of the last one for hypergraphs 
 of small ranks. \n\n\n[Nacim Oijid ] (LaBRI ) \nhttps://nacim-oijid.fr/ \n
 \nRemarks / Remarques \n\nFind all the information of the working group on
  this [ https://graphesetoptimisation.labri.fr/pmwiki.php/Groupe/GT?userla
 ng=en | web page ] . \nRetrouvez toutes les informations du GT sur cette [
  https://graphesetoptimisation.labri.fr/pmwiki.php/Groupe/GT | page web ] 
 .
DTSTART;TZID=Europe/Paris:20240913T140000
DTEND;TZID=Europe/Paris:20240913T150000
LOCATION:LaBRI/178 (bât A30)
SEQUENCE:0
SUMMARY:[gt.go] - 'On the complexity of positional games' by Nacim Oijid
TRANSP:OPAQUE
END:VEVENT
END:VCALENDAR