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
Administrative Support
On this site:
Team
Current Projects
Quantitative verification | Stochastic game theory |Modern graph algorithms for verification problems | Evolutionary game theory
Publications
Zikelic D. 2023. Automated verification and control of infinite state stochastic systems. Institute of Science and Technology Austria. View
Ansaripour M, Chatterjee K, Henzinger TA, Lechner M, Zikelic D. 2023. Learning provably stabilizing neural controllers for discrete-time stochastic systems. 21st International Symposium on Automated Technology for Verification and Analysis. ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 14215, 357–379. View
Avni G, Meggendorfer T, Sadhukhan S, Tkadlec J, Zikelic D. 2023. Reachability poorman discrete-bidding games. Frontiers in Artificial Intelligence and Applications. ECAI: European Conference on Artificial Intelligence vol. 372, 141–148. View
Křišťan JM, Svoboda J. 2023. Shortest dominating set reconfiguration under token sliding. 24th International Symposium on Fundamentals of Computation Theory. FCT: Fundamentals of Computation Theory, LNCS, vol. 14292, 333–347. View
Baier C, Chatterjee K, Meggendorfer T, Piribauer J. 2023. Entropic risk for turn-based stochastic games. 48th International Symposium on Mathematical Foundations of Computer Science. MFCS: Symposium on Mathematical Foundations of Computer Science, LIPIcs, vol. 272, 15. View
ReX-Link: Krishnendu Chatterjee
Career
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
