Quantitative fair simulation games
K. Chatterjee, T.A. Henzinger, J. Otop, Y. Velner, Information and Computation 254 (2017) 143–166.

Faster algorithms for weighted recursive state machines
K. Chatterjee, B. Kragl, S. Mishra, A. Pavlogiannis, in:, H. Yang (Ed.), Springer, 2017, pp. 287–313.

Optimizing expectation with guarantees in POMDPs
K. Chatterjee, P. Novotný, G. Pérez, J. Raskin, D. Zikelic, in:, Proceedings of the 31st AAAI Conference on Artificial Intelligence, AAAI Press, 2017, pp. 3725–3732.

Optional interactions and suspicious behaviour facilitates trustful cooperation in prisoners dilemma
T. Priklopil, K. Chatterjee, M. Nowak,  Journal of Theoretical Biology 433 (2017) 64–72.

Stochastic invariants for probabilistic termination
K. Chatterjee, P. Novotný, D. Zikelic, in:, ACM, 2017, pp. 145–160.

Non-polynomial worst case analysis of recursive programs
K. Chatterjee, H. Fu, A.K. Goharshady, in:, R. Majumdar, V. Kundak (Eds.), Springer, 2017, pp. 41–63.

JTDec: A tool for tree decompositions in soot
K. Chatterjee, A.K. Goharshady, A. Pavlogiannis, in:, D. D’Souza (Ed.), Springer, 2017, pp. 59–66.

Conditionally optimal algorithms for generalized Büchi Games
K. Chatterjee, W. Dvorák, M.H. Henzinger, V. Loitzenbauer, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016.

On the skolem problem for continuous linear dynamical systems
V.K. Chonev, J. Ouaknine, J. Worrell, in:, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik, 2016.

Computation tree logic for synchronization properties
K. Chatterjee, L. Doyen, in:, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik, 2016.

Nested weighted limit-average automata of bounded width
K. Chatterjee, T.A. Henzinger, J. Otop, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016.

Quantitative automata under probabilistic semantics
K. Chatterjee, T.A. Henzinger, J. Otop, in:, Proceedings of the 31st Annual ACM/IEEE Symposium, IEEE, 2016, pp. 76–85.

Model and objective separation with conditional lower bounds: disjunction is harder than conjunction
K. Chatterjee, W. Dvoák, M.H. Henzinger, V. Loitzenbauer, in:, Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, IEEE, 2016, pp. 197–206.

Robust draws in balanced knockout tournaments
K. Chatterjee, R. Ibsen-Jensen, J. Tkadlec, in:, AAAI Press, 2016, pp. 172–179.

Only the combination of mathematics and agent based simulations can leverage the full potential of evolutionary modeling: Comment on cEvolutionary game theory using agent-based methodsd by C. Adami, J. Schossau and A. Hintze
C. Hilbe, A. Traulsen, Physics of Life Reviews 19 (2016) 29–31.

Game-theoretic models identify useful principles for peer collaboration in online learning platforms
V. Pandey, K. Chatterjee, in:, Proceedings of the ACM Conference on Computer Supported Cooperative Work, ACM, 2016, pp. 365–368.

Stability in graphs and games
T. Brázdil, V. Forejt, A. Kudera, P. Novotný, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016.

Indefinite-horizon reachability in Goal-DEC-POMDPs
K. Chatterjee, M. Chmelik, in:, Proceedings of the Twenty-Sixth International Conference on International Conference on Automated Planning and Scheduling, AAAI Press, 2016, pp. 88–96.

Stochastic shortest path with energy constraints in POMDPs
T. Brázdil, K. Chatterjee, M. Chmelik, A. Gupta, P. Novotný, in:, Proceedings of the 15th International Conference on Autonomous Agents and Multiagent Systems, ACM, 2016, pp. 1465–1466.

Optimizing the expected mean payoff in Energy Markov Decision Processes
T. Brázdil, A. Kudera, P. Novotný, in:, Springer, 2016, pp. 32–49.