{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,12]],"date-time":"2025-07-12T22:55:55Z","timestamp":1752360955660},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030308056"},{"type":"electronic","value":"9783030308063"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-30806-3_5","type":"book-chapter","created":{"date-parts":[[2019,9,6]],"date-time":"2019-09-06T13:08:36Z","timestamp":1567775316000},"page":"48-62","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On Relevant Equilibria in Reachability Games"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Brihaye","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V\u00e9ronique","family":"Bruy\u00e8re","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aline","family":"Goeminne","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nathan","family":"Thomasset","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,9,6]]},"reference":[{"key":"5_CR1","unstructured":"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\u201317 December 2014, New Delhi, India, pp. 351\u2013363 (2014)"},{"key":"5_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/978-3-319-21668-3_15","volume-title":"Computer Aided Verification","author":"R Brenguier","year":"2015","unstructured":"Brenguier, R., Raskin, J.-F.: Pareto curves of multidimensional mean-payoff games. In: Kroening, D., P\u0103s\u0103reanu, C.S. (eds.) CAV 2015. LNCS, vol. 9207, pp. 251\u2013267. Springer, Cham (2015). \n                    https:\/\/doi.org\/10.1007\/978-3-319-21668-3_15"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Brihaye, T., Bruy\u00e8re, V., De Pril, J., Gimbert, H.: On subgame perfection in quantitative reachability games. Logical Methods Comput. Sci. 9(1) (2012)","DOI":"10.2168\/LMCS-9(1:7)2013"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Brihaye, T., Bruy\u00e8re, V., Goeminne, A., Raskin, J.: Constrained existence problem for weak subgame perfect equilibria with \n                    \n                      \n                    \n                    $$\\omega $$\n                    \n                      \n                        \u03c9\n                      \n                    \n                  -regular Boolean objectives. In: Proceedings Ninth International Symposium on Games, Automata, Logics, and Formal Verification, GandALF 2018, 26\u201328th September 2018, Saarbr\u00fccken, Germany, pp. 16\u201329 (2018)","DOI":"10.4204\/EPTCS.277.2"},{"key":"5_CR5","unstructured":"Brihaye, T., Bruy\u00e8re, V., Goeminne, A., Raskin, J., van den Bogaard, M.: The complexity of subgame perfect equilibria in quantitative reachability games. CoRR abs\/1905.00784 (2019). \n                    http:\/\/arxiv.org\/abs\/1905.00784"},{"key":"5_CR6","unstructured":"Brihaye, T., Bruy\u00e8re, V., Goeminne, A., Raskin, J., van den Bogaard, M.: The complexity of subgame perfect equilibria in quantitative reachability games. CONCUR 2019 (2019)"},{"key":"5_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/978-3-642-35722-0_5","volume-title":"Logical Foundations of Computer Science","author":"T Brihaye","year":"2013","unstructured":"Brihaye, T., De Pril, J., Schewe, S.: Multiplayer cost games with simple Nash equilibria. In: Artemov, S., Nerode, A. (eds.) LFCS 2013. LNCS, vol. 7734, pp. 59\u201373. Springer, Heidelberg (2013). \n                    https:\/\/doi.org\/10.1007\/978-3-642-35722-0_5"},{"issue":"1","key":"5_CR8","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/s00236-016-0276-z","volume":"54","author":"T Brihaye","year":"2017","unstructured":"Brihaye, T., Geeraerts, G., Haddad, A., Monmege, B.: Pseudopolynomial iterative algorithm to solve total-payoff games and min-cost reachability games. Acta Inf. 54(1), 85\u2013125 (2017)","journal-title":"Acta Inf."},{"key":"5_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-62809-7_1","volume-title":"Developments in Language Theory","author":"V Bruy\u00e8re","year":"2017","unstructured":"Bruy\u00e8re, V.: Computer aided synthesis: a game-theoretic approach. In: Charlier, \u00c9., Leroy, J., Rigo, M. (eds.) DLT 2017. LNCS, vol. 10396, pp. 3\u201335. Springer, Cham (2017). \n                    https:\/\/doi.org\/10.1007\/978-3-319-62809-7_1"},{"key":"5_CR10","unstructured":"Condurache, R., Filiot, E., Gentilini, R., Raskin, J.F.: The complexity of rational synthesis. In: Chatzigiannakis, I., Mitzenmacher, M., Rabani, Y., Sangiorgi, D. (eds.) 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), vol. 55, pp. 121:1\u2013121:15. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl (2016)"},{"key":"5_CR11","unstructured":"Conitzer, V., Sandholm, T.: Complexity results about Nash equilibria. CoRR cs.GT\/0205074 (2002). \n                    http:\/\/arxiv.org\/abs\/cs.GT\/0205074"},{"key":"5_CR12","unstructured":"Haddad, A.: Characterising Nash equilibria outcomes in fully informed concurrent games. \n                    http:\/\/web1.ulb.ac.be\/di\/verif\/haddad\/H16.pdf"},{"issue":"2","key":"5_CR13","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1007\/s00224-007-9025-6","volume":"43","author":"L Khachiyan","year":"2008","unstructured":"Khachiyan, L., et al.: On short paths interdiction problems: total and node-wise limited interdiction. Theory Comput. Syst. 43(2), 204\u2013233 (2008)","journal-title":"Theory Comput. Syst."},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Nash, J.F.: Equilibrium points in \n                    \n                      \n                    \n                    $$n$$\n                    \n                      \n                        n\n                      \n                    \n                  -person games. In: PNAS, vol. 36, pp. 48\u201349. National Academy of Sciences (1950)","DOI":"10.1073\/pnas.36.1.48"},{"key":"5_CR15","unstructured":"Osborne, M.: An Introduction to Game Theory. Oxford University Press, Oxford (2004)"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Pnueli, A., Rosner, R.: On the synthesis of a reactive module. In: POPL, pp. 179\u2013190. ACM Press (1989)","DOI":"10.1145\/75277.75293"},{"key":"5_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1007\/11944836_21","volume-title":"FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science","author":"M Ummels","year":"2006","unstructured":"Ummels, M.: Rational behaviour and strategy construction in infinite multiplayer games. In: Arun-Kumar, S., Garg, N. (eds.) FSTTCS 2006. LNCS, vol. 4337, pp. 212\u2013223. Springer, Heidelberg (2006). \n                    https:\/\/doi.org\/10.1007\/11944836_21"},{"key":"5_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/978-3-540-78499-9_3","volume-title":"Foundations of Software Science and Computational Structures","author":"M Ummels","year":"2008","unstructured":"Ummels, M.: The complexity of Nash equilibria in infinite multiplayer games. In: Amadio, R. (ed.) FoSSaCS 2008. LNCS, vol. 4962, pp. 20\u201334. Springer, Heidelberg (2008). \n                    https:\/\/doi.org\/10.1007\/978-3-540-78499-9_3"}],"container-title":["Lecture Notes in Computer Science","Reachability Problems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-30806-3_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,6]],"date-time":"2019-09-06T13:09:46Z","timestamp":1567775386000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-30806-3_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030308056","9783030308063"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-30806-3_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"6 September 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"RP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Reachability Problems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brussels","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Belgium","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"rp2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.uclouvain.be\/rp2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}