1. Bouyer, P., Markey, N., Stan, D.: Mixed Nash equilibria in concurrent terminal-reward games. In: 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, FSTTCS 2014, 15–17 December 2014, New Delhi, India, pp. 351–363 (2014)
2. Lecture Notes in Computer Science;R Brenguier,2015
3. Brihaye, T., Bruyère, V., De Pril, J., Gimbert, H.: On subgame perfection in quantitative reachability games. Logical Methods Comput. Sci. 9(1) (2012)
4. Brihaye, T., Bruyère, V., Goeminne, A., Raskin, J.: Constrained existence problem for weak subgame perfect equilibria with
$$\omega $$
ω
-regular Boolean objectives. In: Proceedings Ninth International Symposium on Games, Automata, Logics, and Formal Verification, GandALF 2018, 26–28th September 2018, Saarbrücken, Germany, pp. 16–29 (2018)
5. Brihaye, T., Bruyère, V., Goeminne, A., Raskin, J., van den Bogaard, M.: The complexity of subgame perfect equilibria in quantitative reachability games. CoRR abs/1905.00784 (2019).
http://arxiv.org/abs/1905.00784