Skip to main content

Chatterjee Group

Computer-Aided Verification, Game Theory

Life is a game – at least in theory. Game theory has implications for the verification of correctness of computer hardware and software, but also in biological applications, such as evolutionary game theory. The Chatterjee group works on the theoretical foundations of game theory, addressing central questions in computer science.

Game theory studies the interactive problems in decision making. It can be used to study problems in logic, automata theory, economics, evolutionary biology, and the design of the internet. The Chatterjee group is interested in the theoretical foundations of game theory, its application in formal verification, and evolutionary game theory. Game theory in formal verification involves the algorithmic analysis of various forms of games played on graphs, where the graph models a reactive system. This broad framework allows for the effective analysis of many important questions in computer science and helps to develop robust systems. The Chatterjee group also works on algorithmic aspects of evolutionary game theory on graphs, where the graph models a population structure. The goals of this research are to better understand games and to develop new algorithms.

On this site:


Current Projects

Quantitative verification | Stochastic game theory |Modern graph algorithms for verification problems | Evolutionary game theory


Schmid L, Ekbatani F, Hilbe C, Chatterjee K. 2023. Quantitative assessment can stabilize indirect reciprocity under imperfect information. Nature Communications. 14, 2086. View

Svoboda J, Tkadlec J, Kaveh K, Chatterjee K. 2023. Coexistence times in the Moran process with environmental heterogeneity. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences. 479(2271), 20220685. View

Chatterjee K, Katoen JP, Mohr S, Weininger M, Winkler T. 2023. Stochastic games with lexicographic objectives. Formal Methods in System Design. View

Mckerral JC, Kleshnina M, Ejov V, Bartle L, Mitchell JG, Filar JA. 2023. Empirical parameterisation and dynamical analysis of the allometric Rosenzweig-MacArthur equations. PLoS One. 18(2), e0279838. View

Chatterjee K, Meggendorfer T, Saona Urmeneta RJ, Svoboda J. 2023. Faster algorithm for turn-based stochastic games with bounded treewidth. Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 4590–4605. View

View All Publications

ReX-Link: Krishnendu Chatterjee


since 2014 Professor, Institute of Science and Technology Austria (ISTA)
2009 – 2014 Assistant Professor, Institute of Science and Technology Austria (ISTA)
2008 – 2009 Postdoc, University of California, Santa Cruz, USA
2007 PhD, University of California, Berkeley, USA

Selected Distinctions

2019 ERC Consolidator Grant
2011 Microsoft Research Faculty Fellowship
2011 ERC Starting Grant
2008 Ackerman Award, best thesis worldwide in Computer Science Logic
2007 David J. Sakrison Prize, best thesis in EECS, University of California, Berkeley, USA
2001 President of India Gold Medal, best IIT student of the year

Additional Information

Open Chatterjee website

theme sidebar-arrow-up
Back to Top