Bloem, Roderick, et al. “Graph Games and Reactive Synthesis.”10.1007/978-3-319-10575-8_27__Handbook of Model Checking, edited by Thomas A Henzinger et al., 1st ed., Springer, 2018, pp. 921–62, doi:10.1007/978-3-319-10575-8_27.

Chatterjee, Krishnendu, et al. “Computing Average Response Time.”10.1007/978-3-319-95246-8_9__Principles of Modeling, edited by Marten Lohstroh et al., vol. 10760, Springer, 2018, pp. 143–61, doi:10.1007/978-3-319-95246-8_9.

Reiter, Johannes, et al. “Crosstalk in Concurrent Repeated Games Impedes Direct Reciprocity and Requires Stronger Levels of Forgiveness.”10.1038/s41467-017-02721-8__Nature Communications, vol. 9, no. 1, 555, Nature Publishing Group, 2018, doi:10.1038/s41467-017-02721-8.

Brázdil, Tomás, et al. Efficient Algorithms for Asymptotic Bounds on Termination Time in VASS. Vol. 8033, IEEE, 2018, pp. 185–94, doi:10.1145/3209108.3209191.

Hilbe, Christian, et al. “Evolution of Cooperation in Stochastic Games.”10.1038/s41586-018-0277-x__Nature, vol. 559, no. 7713, Nature Publishing Group, 2018, pp. 246–49, doi:10.1038/s41586-018-0277-x.

Chatterjee, Krishnendu, et al. Lower Bounds for Symbolic Computation on Graphs: Strongly Connected Components, Liveness, Safety, and Diameter. ACM, 2018, pp. 2341–56, doi:10.1137/1.9781611975031.151.

Huang, Mingzhang, et al. New Approaches for Almost-Sure Termination of Probabilistic Programs. Edited by Sukyoung Ryu, vol. 11275, Springer, 2018, pp. 181–201, doi:10.1007/978-3-030-02768-1_11.

Hilbe, Christian, et al. “Partners and Rivals in Direct Reciprocity.”10.1038/s41562-018-0320-9__Nature Human Behaviour, vol. 2, Nature Publishing Group, 2018, pp. 469–477, doi:10.1038/s41562-018-0320-9.

Arming, Sebastian, et al. Parameter-Independent Strategies for PMDPs via POMDPs. Vol. 11024, Springer, 2018, pp. 53–70, doi:10.1007/978-3-319-99154-2_4.

Brázdil, Tomás, et al. Strategy Representation by Decision Trees in Reactive Synthesis. Vol. 10805, Springer, 2018, pp. 385–407, doi:10.1007/978-3-319-89960-2_21.