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.

Humans choose representatives who enforce cooperation in social dilemmas through extortion
M. Milinski, C. Hilbe, D. Semmann, R. Sommerfeld, J. Marotzke, Nature Communications 7 (2016).

Quantitative monitor automata
K. Chatterjee, T.A. Henzinger, J. Otop, in:, Springer, 2016, pp. 23–38.

The big match in small space
K. Hansen, R. Ibsen-Jensen, M. Koucký, in:, Springer, 2016, pp. 64–76.

On the complexity of the orbit problem
V.K. Chonev, J. Ouaknine, J. Worrell, Journal of the ACM 63 (2016).

On recurrent reachability for continuous linear dynamical systems
V.K. Chonev, J. Ouaknine, J. Worrell, in:, LICS ’16, IEEE, 2016, pp. 515–524.

Coevolutionary interactions between farmers and mafia induce host acceptance of avian brood parasites
M. Chakra, C. Hilbe, A. Traulsen, Royal Society Open Science 3 (2016).

Comparing reactive and memory-one strategies of direct reciprocity
S. Baek, H. Jeong, C. Hilbe, M. Nowak, Scientific Reports 6 (2016).

Efficient strategies for calculating blockwise likelihoods under the coalescent
K. Lohse, M. Chmelik, S. Martin, N.H. Barton, Genetics 202 (2016) 775–786.

The complexity of deciding legality of a single step of magic: The gathering
K. Chatterjee, R. Ibsen-Jensen, in:, IOS Press, 2016, pp. 1432–1439.

Perfect-information stochastic games with generalized mean-payoff objectives
K. Chatterjee, L. Doyen, in:, IEEE, 2016, pp. 247–256.