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

Hübner V, Staab M, Hilbe C, Chatterjee K, Kleshnina M. 2024. Efficiency and resilience of cooperation in asymmetric social dilemmas. Proceedings of the National Academy of Sciences. 121(10), e2315558121. View

Hübner V, Kleshnina M. 2024. Computer code for ‘Efficiency and resilience of cooperation in asymmetric social dilemmas’, Zenodo, 10.5281/ZENODO.10639167. View

Hirvonen J, Schmid L, Chatterjee K, Schmid S. 2024. On the convergence time in graphical games: A locality-sensitive approach. 27th International Conference on Principles of Distributed Systems. OPODIS: Conference on Principles of Distributed Systems, LIPIcs, vol. 286, 11. View

Schmid S, Svoboda J, Yeo MX. 2024. Weighted packet selection for rechargeable links in cryptocurrency networks: Complexity and approximation. Theoretical Computer Science. 989, 114353. View

Zikelic D, Lechner M, Verma A, Chatterjee K, Henzinger TA. 2023. Compositional policy learning in stochastic control systems with formal guarantees. 37th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems. 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