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.




Team


Current Projects

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


Publications

Chatterjee K, Goharshady AK, Goharshady E, Karrabi M, Zikelic D. 2024. Sound and complete witnesses for template-based verification of LTL properties on polynomial programs. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). FM: Formal Methods, LNCS, vol. 14933, 600–619. View

Akshay S, Chatterjee K, Meggendorfer T, Zikelic D. 2024. Certified policy verification and synthesis for MDPs under distributional reach-avoidance properties. Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence. IJCAI: International Joint Conference on Artificial Intelligence, 3–12. View

Baier C, Chatterjee K, Meggendorfer T, Piribauer J. 2024. Entropic risk for turn-based stochastic games. Information and Computation. 301, 105214. View

Asadi A, Chatterjee K, Svoboda J, Saona Urmeneta RJ. 2024. Deterministic sub-exponential algorithm for discounted-sum games with unary weights. 39th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Symposium on Logic in Computer Science, 6. View

Meggendorfer T, Weininger M. 2024. Playing games with your PET: Extending the Partial Exploration Tool to stochastic games. 36th International Conference on Computer Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 14683, 359–372. View

View All Publications

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


Additional Information

Open Chatterjee website



theme sidebar-arrow-up
Back to Top