Due to problems with editing this website we will use the L2P for announcements and for publishing exercise sheets. If you do not have access to this lecture's L2P room, please write to dannert@logic.rwth-aachen.de so you can be added.
There will be no lecture on Tuesday, November 20th.
Please hand in the solutions to the exercises in groups of two. You may write in either german or english and are free to write per hand or print your solution.
Understanding the fundamental concepts and problems of algorithmic game theory, especially the connection of logic and game theory. Knowledge of the logical and algorithmical methods to handle infinite games. Using infinite games as a model to evaluate logical formulae on reactive systems.
Fundamental concepts in game theory, these include finite and infinite games, model-checking games, determinism, non-determinism, Borel-games, Muller-games and parity games. Complexity and definability of winning regions, algorithmic synthesis and optimisation of winning strategies. Mupltiplayer games and strategic games.
 J. Y. Halpern and R. Pass. Iterated regret minimization: A new solution concept. Games and Economic Behavior, vol. 74(1), pp. 184–207, 2012.