@InProceedings{brihaye_et_al:LIPIcs.CONCUR.2019.13,
author = {Brihaye, Thomas and Bruy\`{e}re, V\'{e}ronique and Goeminne, Aline and Raskin, Jean-Fran\c{c}ois and van den Bogaard, Marie},
title = {{The Complexity of Subgame Perfect Equilibria in Quantitative Reachability Games}},
booktitle = {30th International Conference on Concurrency Theory (CONCUR 2019)},
pages = {13:1--13:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-121-4},
ISSN = {1868-8969},
year = {2019},
volume = {140},
editor = {Fokkink, Wan and van Glabbeek, Rob},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2019.13},
URN = {urn:nbn:de:0030-drops-109153},
doi = {10.4230/LIPIcs.CONCUR.2019.13},
annote = {Keywords: multiplayer non-zero-sum games played on graphs, quantitative reachability objectives, subgame perfect equilibria, constrained existence problem}
}