We play positional games on edge sets of graphs, two players alternately claim unclaimed edges of a given graph until all the edges are claimed. There are several variants of positional games:
Generally, given a game (i.e. given a base graph, a target graph property, and a variant of positional game) we want to figure out which player has a winning strategy. (It is known that one player must have a winning strategy.)
We can choose a more focused topic, depending on the interest. In any case, there is a number of open problems to work on.
13-17 September 2021
Registration details: closed August 29th.
Submission details: Send them by email to the organizers.
Submission deadline: Friday September 10th, 2021 (AoE)
1. Monday * 10:00 (CET) Miloš Stojaković: Tutorial on Positional Games (The tutorial is meant for those who would like to brush up their knowledge on positional games.) * 14:00 (CET) Open Problem Session 2. Tuesday - Friday * Work in groups.
Zoom link to tutorial: https://us02web.zoom.us/j/85951587794?pwd=WkxQekluNHBmOHlSSllxSVhaRHR2dz09