Marcin Jurdzinski is an Associate Professor of Computer Science at the University of Warwick, UK. He has obtained his MSc and PhD in Computer Science from the Univeristy of Warsaw, Poland, and from the University of Aarhus, Denmark, respectively. Before settling down at Warwick, he has worked as a postdoctoral researcher at the University of California, Berkeley, USA and at Université Paris 7, France. His research interests span a range of topics in theoretical computer science from logic and automata to algorithmic game theory. His work includes undecidability results for models of concurrency, computational complexity results for infinite-state systems, and efficient algorithms for computing approximate Nash equilibria, but his most persistent line of research, spanning his whole career, is the work on computational complexity and algorithms for solving parity games and other related games on graphs.