He obtained his PhD in 2007 and later moved to UC Santa Cruz for a postdoc.[1] He then joined ISTA in 2009 as an assistant professor and was promoted to professor in 2014.[2] In his research, he studies graph games with omega-regular and quantitative objectives,[5] especially variants with probabilistic moves, multiple objectives, and/or partial information. Recently, he has also been applying computational methods to evolutionary game theory.[6] He has described the computational complexity of various evolutionary processes,[7] and he has extended models of direct and indirect reciprocity.[8]
^Chatterjee, Krishnendu; Doyen, Laurent; Henzinger, Thomas A.; Raskin, Jean-François (2006), "Algorithms for Omega-Regular Games with Imperfect Information", Computer Science Logic, Springer Berlin Heidelberg, pp. 287–302, arXiv:0706.2619, doi:10.1007/11874683_19, ISBN9783540454588
