Note: This is an archvied version of our old webpage. Some links might be broken. The current one can be found here.

Lectures

Exercises

Alternating with the lectures, no fixed scheduled, will be announced in class.

Expected previous knowledge

Basics of graph theory, formal language theory, probability theory, and logics as taught in the courses IN0015, IN011, and IN0018.

Courses IN2041 (automata and formal languages), IN2049 (logics), and IN2239 (algorithmic game theory) can be of help, but are not required.

Content (Outline)

We studied the most important winning conditions studied in theoretical computer science (verification, synthesis, logics), and mathematics (topology, operations research) and their relation.