{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,5]],"date-time":"2026-10-05T00:53:23Z","timestamp":1791161603965,"version":"4.1.0"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,8,28]],"date-time":"2013-08-28T00:00:00Z","timestamp":1377648000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2014,2]]},"DOI":"10.1007\/s00224-013-9495-7","type":"journal-article","created":{"date-parts":[[2013,8,27]],"date-time":"2013-08-27T00:39:00Z","timestamp":1377563940000},"page":"150-189","source":"Crossref","is-referenced-by-count":5,"title":["On Equilibria in Quantitative Games with Reachability\/Safety Objectives"],"prefix":"10.1007","volume":"54","author":[{"given":"Thomas","family":"Brihaye","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"V\u00e9ronique","family":"Bruy\u00e8re","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Julie","family":"De\u00a0Pril","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2013,8,28]]},"reference":[{"key":"9495_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1007\/978-3-540-70545-1_23","volume-title":"Computer Aided Verification, 20th International Conference, CAV 2008","author":"R. Alur","year":"2008","unstructured":"Alur, R., Kanade, A., Weiss, G.: Ranking automata and games for prioritized requirements. In: Computer Aided Verification, 20th International Conference, CAV 2008. Lecture Notes in Computer Science, vol. 5123, pp. 240\u2013253. Springer, Berlin (2008)"},{"key":"9495_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1007\/978-3-642-02658-4_14","volume-title":"CAV: Computer-Aided Verification","author":"R. Bloem","year":"2009","unstructured":"Bloem, R., Chatterjee, K., Henzinger, T., Jobstmann, B.: Better quality in synthesis through quantitative objectives. In: CAV: Computer-Aided Verification. Lecture Notes in Computer Science, vol.\u00a05643, pp. 140\u2013156. Springer, Berlin (2009)"},{"key":"9495_CR3","unstructured":"Boros, E., Gurvich, V.: Why chess and back gammon can be solved in pure positional uniformly optimal strategies. Rutcor Research Report 21-2009, Rutgers University, (2009)"},{"key":"9495_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1007\/978-3-642-13182-0_7","volume-title":"CSR","author":"T. Brihaye","year":"2010","unstructured":"Brihaye, T., Bruy\u00e8re, V., De Pril, J.: Equilibria in quantitative reachability games. In: Ablayev, F.M., Mayr, E.W. (eds.) CSR. Lecture Notes in Computer Science, vol. 6072, pp. 72\u201383. Springer, Berlin (2010)"},{"key":"9495_CR5","doi-asserted-by":"crossref","unstructured":"Brihaye, T., Bruy\u00e8re, V., De Pril, J.: On subgame perfection in quantitative reachability games. Log. Methods Comput. Sci. 9(1) (2012)","DOI":"10.2168\/LMCS-9(1:7)2013"},{"issue":"1\u20132","key":"9495_CR6","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/j.tcs.2006.07.032","volume":"365","author":"K. Chatterjee","year":"2006","unstructured":"Chatterjee, K., Henzinger, T., Jurdzi\u0144ski, M.: Games with secure equilibria. Theor. Comput. Sci. 365(1\u20132), 67\u201382 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"9495_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/11691372_17","volume-title":"TACAS","author":"K. Chatterjee","year":"2006","unstructured":"Chatterjee, K., Henzinger, T.A.: Finitary winning in omega-regular games. In: TACAS. Lecture Notes in Computer Science, vol. 3920, pp. 257\u2013271. Springer, Berlin (2006)"},{"key":"9495_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1007\/978-3-540-30124-0_6","volume-title":"CSL","author":"K. Chatterjee","year":"2004","unstructured":"Chatterjee, K., Majumdar, R., Jurdzinski, M.: On Nash equilibria in stochastic games. In: Marcinkowski, J., Tarlecki, A. (eds.) CSL. Lecture Notes in Computer Science, vol. 3210, pp. 26\u201340. Springer, Berlin (2004)"},{"key":"9495_CR9","volume-title":"Model Checking","author":"E. Clarke","year":"2000","unstructured":"Clarke, E., Grumberg, O., Peled, D.: Model Checking. MIT Press, Cambridge (2000)"},{"key":"9495_CR10","series-title":"Lecture Notes in Computer Science.","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-36387-4","volume-title":"Automata, Logics, and Infinite Games","author":"E. Gr\u00e4del","year":"2002","unstructured":"Gr\u00e4del, E., Thomas, W., Wilke, T.: Automata, Logics, and Infinite Games. Lecture Notes in Computer Science., vol. 2500. Springer, Berlin (2002)"},{"key":"9495_CR11","series-title":"Texts in Logic and Games","first-page":"151","volume-title":"New Perspectives on Games and Interaction","author":"E. Gr\u00e4del","year":"2008","unstructured":"Gr\u00e4del, E., Ummels, M.: Solution concepts and algorithms for infinite multiplayer games. In: Apt, K., van Rooij, R. (eds.) New Perspectives on Games and Interaction. Texts in Logic and Games, vol. 4, pp. 151\u2013178. Amsterdam University Press, Amsterdam (2008)"},{"key":"9495_CR12","series-title":"Addison-Wesley Series in Computer Science","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J.E. Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley Series in Computer Science. Addison-Wesley, Reading (1979)"},{"key":"9495_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/978-3-540-88387-6_31","volume-title":"Automated Technology for Verification and Analysis, 6th International Symposium, ATVA 2008","author":"F. Horn","year":"2008","unstructured":"Horn, F., Thomas, W., Wallmeier, N.: Optimal strategy synthesis in request-response games. In: Automated Technology for Verification and Analysis, 6th International Symposium, ATVA 2008. Lecture Notes in Computer Science, vol. 5311, pp. 361\u2013373. Springer, Berlin (2008)"},{"key":"9495_CR14","first-page":"46","volume-title":"Classics in Game Theory","author":"H. Kuhn","year":"1953","unstructured":"Kuhn, H.: Extensive games and the problem of information. In: Classics in Game Theory, pp. 46\u201368 (1953)"},{"issue":"2","key":"9495_CR15","doi-asserted-by":"crossref","first-page":"363","DOI":"10.2307\/1971035","volume":"102","author":"D. Martin","year":"1975","unstructured":"Martin, D.: Borel determinacy. Ann. Math. 102(2), 363\u2013371 (1975)","journal-title":"Ann. Math."},{"issue":"1","key":"9495_CR16","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1073\/pnas.36.1.48","volume":"36","author":"J. Nash","year":"1950","unstructured":"Nash, J.: Equilibrium points in n-person games. Proc. Natl. Acad. Sci. USA 36(1), 48\u201349 (1950)","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"9495_CR17","volume-title":"A Course in Game Theory","author":"M. Osborne","year":"1994","unstructured":"Osborne, M., Rubinstein, A.: A Course in Game Theory. MIT Press, Cambridge (1994)"},{"key":"9495_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/3-540-60275-5","volume-title":"STACS 95","author":"W. Thomas","year":"1995","unstructured":"Thomas, W.: On the synthesis of strategies in infinite games. In: STACS 95, Munich, 1995. Lecture Notes in Computer Science, vol. 900, pp. 1\u201313. Springer, Berlin (1995)"},{"key":"9495_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/978-3-642-02979-0_25","volume-title":"CIAA","author":"M. Zimmermann","year":"2009","unstructured":"Zimmermann, M.: Time-optimal winning strategies for poset games. In: CIAA. Lecture Notes in Computer Science, vol. 5642, pp. 217\u2013226. Springer, Berlin (2009)"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-013-9495-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-013-9495-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-013-9495-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,21]],"date-time":"2019-07-21T23:47:32Z","timestamp":1563752852000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-013-9495-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,8,28]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,2]]}},"alternative-id":["9495"],"URL":"https:\/\/doi.org\/10.1007\/s00224-013-9495-7","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,8,28]]}}}