Abstract
We survey classical and new algorithmic results about concurrent reachability games.
Bio of the Speaker
Peter Bro Miltersen is professor of computer science at Aarhus University, Denmark. His interests include computational complexity theory and algorithmic and computational game theory. He is principal investigator of the Center for Algorithmic Game Theory, funded by the Carlsberg foundation. He is currently serving a three year term as steering committee chair of the IEEE Conference on Computational Complexity Theory.
