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.

Group Leader


On this site:


Team


Current Projects

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


Publications

Ashok P, Chatterjee K, Kretinsky J, Weininger M, Winkler T. Approximating values of generalized-reachability stochastic games. Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science . LICS: Symposium on Logic in Computer Science 102–115. View

Chatterjee K, Goharshady AK, Ibsen-Jensen R, Pavlogiannis A. 2020. Optimal and perfectly parallel algorithms for on-demand data-flow analysis. European Symposium on Programming. ESOP: Programming Languages and Systems, LNCS, vol. 12075. 112–140. View

Schmid L, Chatterjee K, Schmid S. 2020. The evolutionary price of anarchy: Locally bounded agents in a dynamic virus game. Proceedings of the 23rd International Conference on Principles of Distributed Systems. OPODIS: International Conference on Principles of Distributed Systems, LIPIcs, vol. 153. 21. View

Tkadlec J, Pavlogiannis A, Chatterjee K, Nowak MA. 2020. Limits on amplifiers of natural selection under death-Birth updating. PLoS computational biology. 16, e1007494. View

Milutinovic B, Stock M, Grasse AV, Naderlinger E, Hilbe C, Cremer S. 2020. Social immunity modulates competition between coinfecting pathogens. Ecology Letters. View

View All Publications

Career

since 2014 Professor, IST Austria
2009 – 2014 Assistant Professor, IST Austria
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



Back to Top