Seminar “Games and Graphs”
Seminar “Games and Graphs”
Course with SWS 0/2/0 (lecture/exercise/practical) in WS 2026
The topic of this seminar are infinite-duration games that are played between two or more players on a graph structure. Such games can be used to model a wide range of multi-agent systems or as theoretical tools in areas like logic and complexity theory. Hence, they play an important role in theoretical computer science, in particular in verification and synthesis. The topics of the seminar address various forms of these games with different objectives and properties and algorithms to solve them.
Many of the topics can be found in the book “Games on graphs: From logic and automata to algorithms” edited by Fijalkow et al. (2025).
Registration
Registration via Opal is required until October 19. We will link to the Opal course once it is set up.
Prerequisites
For the seminar, profound knowledge in theoretical computer science and logics is presumed.
Dates
All participants registered in Opal by the due date will be notified about the initial meeting by e-mail. Each participant will then be assigned a topic and a supervisor. After that, further proceedings are arranged individually between each participant and their supervisor.
Presentations will be held between January and March 2027. The specific dates will be announced later.
The seminar paper (Seminararbeit) is due by February 28, 2027.
Examination
Master Computer Science (PO 2025)
- INF-25-Ma-FTK-Sem: Komplexe Leistung (40 hours)
Diplom Informatik (PO 2025)
- INF-25-Ma-FTK-Sem: Komplexe Leistung (40 hours)
The Komplexe Leistung (complex or multi-part examination) consists of a 30-minute presentation taking the form of a colloquium and a 10-page seminar paper.
Contact
In case of organizational questions, please contact Jakob Piribauer.
