@inproceedings{brihaye_et_al:LIPIcs:2019:10915,
    Address = {Dagstuhl, Germany},
    Annote = {Keywords: multiplayer non-zero-sum games played on graphs, quantitative reachability objectives, subgame perfect equilibria, constrained existence problem},
    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},
    BookTitle = {30th International Conference on Concurrency Theory (CONCUR 2019)},
    Editor = {Fokkink, Wan and van Glabbeek, Rob},
    File = {The Complexity of Subgame Perfect Equilibria in Quantitative Reachability Games - LIPIcs-CONCUR-2019-13 (0) - a - a - n.pdf},
    ISBN = {978-3-95977-121-4},
    ISSN = {1868-8969},
    Keywords = {citesme!},
    Pages = {13:1--13:16},
    Publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
    Series = {Leibniz International Proceedings in Informatics (LIPIcs)},
    Title = {{The Complexity of Subgame Perfect Equilibria in Quantitative Reachability Games}},
    URL = {http://drops.dagstuhl.de/opus/volltexte/2019/10915},
    Volume = {140},
    Year = {2019},
    bdsk-url-1 = {http://drops.dagstuhl.de/opus/volltexte/2019/10915},
    bdsk-url-2 = {https://doi.org/10.4230/LIPIcs.CONCUR.2019.13},
    date-added = {2019-08-26 09:53:58 +0200},
    date-modified = {2019-08-26 09:54:44 +0200},
    urn = {urn:nbn:de:0030-drops-109153},
    doi = {10.4230/LIPIcs.CONCUR.2019.13}
}

@inproceedings{brihaye_et_al:LIPIcs:2019:10915, Address = {Dagstuhl, Germany}, Annote = {Keywords: multiplayer non-zero-sum games played on graphs, quantitative reachability objectives, subgame perfect equilibria, constrained existence problem}, 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}, BookTitle = {30th International Conference on Concurrency Theory (CONCUR 2019)}, Editor = {Fokkink, Wan and van Glabbeek, Rob}, File = {The Complexity of Subgame Perfect Equilibria in Quantitative Reachability Games - LIPIcs-CONCUR-2019-13 (0) - a - a - n.pdf}, ISBN = {978-3-95977-121-4}, ISSN = {1868-8969}, Keywords = {citesme!}, Pages = {13:1--13:16}, Publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}, Series = {Leibniz International Proceedings in Informatics (LIPIcs)}, Title = {{The Complexity of Subgame Perfect Equilibria in Quantitative Reachability Games}}, URL = {http://drops.dagstuhl.de/opus/volltexte/2019/10915}, Volume = {140}, Year = {2019}, bdsk-url-1 = {http://drops.dagstuhl.de/opus/volltexte/2019/10915}, bdsk-url-2 = {https://doi.org/10.4230/LIPIcs.CONCUR.2019.13}, date-added = {2019-08-26 09:53:58 +0200}, date-modified = {2019-08-26 09:54:44 +0200}, urn = {urn:nbn:de:0030-drops-109153}, doi = {10.4230/LIPIcs.CONCUR.2019.13} }