{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:10:40Z","timestamp":1760202640296,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642357213"},{"type":"electronic","value":"9783642357220"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-35722-0_5","type":"book-chapter","created":{"date-parts":[[2013,1,4]],"date-time":"2013-01-04T11:16:29Z","timestamp":1357298189000},"page":"59-73","source":"Crossref","is-referenced-by-count":11,"title":["Multiplayer Cost Games with Simple Nash Equilibria"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Brihaye","sequence":"first","affiliation":[]},{"given":"Julie","family":"De Pril","sequence":"additional","affiliation":[]},{"given":"Sven","family":"Schewe","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/978-3-540-70545-1_23","volume-title":"Computer Aided Verification","author":"R. Alur","year":"2008","unstructured":"Alur, R., Kanade, A., Weiss, G.: Ranking Automata and Games for Prioritized Requirements. In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol.\u00a05123, pp. 240\u2013253. Springer, Heidelberg (2008)"},{"key":"5_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/978-3-642-02658-4_14","volume-title":"Computer Aided Verification","author":"R. Bloem","year":"2009","unstructured":"Bloem, R., Chatterjee, K., Henzinger, T.A., Jobstmann, B.: Better Quality in Synthesis through Quantitative Objectives. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol.\u00a05643, pp. 140\u2013156. Springer, Heidelberg (2009)"},{"key":"5_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":"5_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/978-3-642-15375-4_14","volume-title":"CONCUR 2010 - Concurrency Theory","author":"P. Bouyer","year":"2010","unstructured":"Bouyer, P., Brenguier, R., Markey, N.: Nash Equilibria for Reachability Objectives in Multi-player Timed Games. In: Gastin, P., Laroussinie, F. (eds.) CONCUR 2010. LNCS, vol.\u00a06269, pp. 192\u2013206. Springer, Heidelberg (2010)"},{"key":"5_CR5","unstructured":"Bouyer, P., Brenguier, R., Markey, N., Ummels, M.: Nash equilibria in concurrent games with B\u00fcchi objectives. In: FSTTCS. LIPIcs, vol.\u00a013, pp. 375\u2013386. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2011)"},{"key":"5_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-642-13182-0_7","volume-title":"Computer Science \u2013 Theory and Applications","author":"T. Brihaye","year":"2010","unstructured":"Brihaye, T., Bruy\u00e8re, V., De Pril, J.: Equilibria in Quantitative Reachability Games. In: Ablayev, F., Mayr, E.W. (eds.) CSR 2010. LNCS, vol.\u00a06072, pp. 72\u201383. Springer, Heidelberg (2010)"},{"key":"5_CR7","unstructured":"Brihaye, T., Bruy\u00e8re, V., De Pril, J.: On equilibria in quantitative games with reachability\/safety objectives. CoRR, abs\/1205.4889 (2012)"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Brihaye, T., De Pril, J., Schewe, S.: Multiplayer Cost Games with Simple Nash Equilibria. Technical report, arXiv:1210.3548 [cs.GT] (2012)","DOI":"10.1007\/978-3-642-35722-0_5"},{"key":"5_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/11691372_17","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"K. Chatterjee","year":"2006","unstructured":"Chatterjee, K., Henzinger, T.A.: Finitary Winning in \u03c9-Regular Games. In: Hermanns, H. (ed.) TACAS 2006. LNCS, vol.\u00a03920, pp. 257\u2013271. Springer, Heidelberg (2006)"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Henzinger, T.A., Jurdzinski, M.: Mean-payoff parity games. In: LICS, pp. 178\u2013187. IEEE Computer Society (2005)","DOI":"10.1109\/LICS.2005.26"},{"key":"5_CR11","volume-title":"Model Checking","author":"E. Clarke","year":"2000","unstructured":"Clarke, E., Grumberg, O., Peled, D.: Model Checking. MIT Press, Cambridge (2000)"},{"key":"5_CR12","unstructured":"Fijalkow, N., Zimmermann, M.: Cost-parity and cost-streett games. CoRR, abs\/1207.0663 (2012)"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Filar, J., Vrieze, K.: Competitive Markov decision processes. Springer (1997)","DOI":"10.1007\/978-1-4612-4054-9"},{"key":"5_CR14","series-title":"Lecture Notes in Computer Science","volume-title":"Automata, Logics, and Infinite Games","year":"2002","unstructured":"Gr\u00e4del, E., Thomas, W., Wilke, T. (eds.): Automata, Logics, and Infinite Games. LNCS, vol.\u00a02500. Springer, Heidelberg (2002)"},{"key":"5_CR15","unstructured":"Gr\u00e4del, E., Ummels, M.: Solution concepts and algorithms for infinite multiplayer games. In: New Perspectives on Games and Interaction. Texts in Logic and Games, vol.\u00a04, pp. 151\u2013178. Amsterdam University Press (2008)"},{"key":"5_CR16","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 Publishing Co., Reading (1979)"},{"key":"5_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/978-3-540-88387-6_31","volume-title":"Automated Technology for Verification and Analysis","author":"F. Horn","year":"2008","unstructured":"Horn, F., Thomas, W., Wallmeier, N.: Optimal Strategy Synthesis in Request-Response Games. In: Cha, S(S.), Choi, J.-Y., Kim, M., Lee, I., Viswanathan, M. (eds.) ATVA 2008. LNCS, vol.\u00a05311, pp. 361\u2013373. Springer, Heidelberg (2008)"},{"key":"5_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/978-3-642-28332-1_31","volume-title":"Language and Automata Theory and Applications","author":"M. Klimo\u0161","year":"2012","unstructured":"Klimo\u0161, M., Larsen, K.G., \u0160tefa\u0148\u00e1k, F., Thaarup, J.: Nash Equilibria in Concurrent Priced Games. In: Dediu, A.-H., Mart\u00edn-Vide, C. (eds.) LATA 2012. LNCS, vol.\u00a07183, pp. 363\u2013376. Springer, Heidelberg (2012)"},{"issue":"2","key":"5_CR19","doi-asserted-by":"publisher","first-page":"363","DOI":"10.2307\/1971035","volume":"102","author":"D.A. Martin","year":"1975","unstructured":"Martin, D.A.: Borel determinacy. Ann. of Math. (2)\u00a0102(2), 363\u2013371 (1975)","journal-title":"Ann. of Math. (2)"},{"issue":"1","key":"5_CR20","doi-asserted-by":"publisher","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. Proceedings of the National Academy of Sciences of the United States of America\u00a036(1), 48\u201349 (1950)","journal-title":"Proceedings of the National Academy of Sciences of the United States of America"},{"key":"5_CR21","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":"5_CR22","unstructured":"Paul, S., Simon, S., Kannan, R., Kumar, K.: Nash equilibrium in generalised muller games. In: FSTTCS. LIPIcs, vol.\u00a04, pp. 335\u2013346. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2009)"},{"key":"5_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-59042-0_57","volume-title":"STACS 95","author":"W. Thomas","year":"1995","unstructured":"Thomas, W.: On the Synthesis of Strategies in Infinite Games. In: Mayr, E.W., Puech, C. (eds.) STACS 1995. LNCS, vol.\u00a0900, pp. 1\u201313. Springer, Heidelberg (1995)"},{"key":"5_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1007\/978-3-540-78127-1_35","volume-title":"Pillars of Computer Science","author":"W. Thomas","year":"2008","unstructured":"Thomas, W.: Church\u2019s Problem and a Tour through Automata Theory. In: Avron, A., Dershowitz, N., Rabinovich, A. (eds.) Pillars of Computer Science. LNCS, vol.\u00a04800, pp. 635\u2013655. Springer, Heidelberg (2008)"},{"issue":"3","key":"5_CR25","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/BF01263280","volume":"26","author":"F. Thuijsman","year":"1998","unstructured":"Thuijsman, F., Raghavan, T.E.S.: Perfect information stochastic games and related classes. International Journal of Game Theory\u00a026(3), 403\u2013408 (1998)","journal-title":"International Journal of Game Theory"},{"key":"5_CR26","unstructured":"Trivedi, A.: Competative optimisation on timed automata. PhD thesis, University of Warwick (2009)"},{"key":"5_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/978-3-642-02979-0_25","volume-title":"Implementation and Application of Automata","author":"M. Zimmermann","year":"2009","unstructured":"Zimmermann, M.: Time-Optimal Winning Strategies for Poset Games. In: Maneth, S. (ed.) CIAA 2009. LNCS, vol.\u00a05642, pp. 217\u2013226. Springer, Heidelberg (2009)"}],"container-title":["Lecture Notes in Computer Science","Logical Foundations of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-35722-0_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,29]],"date-time":"2025-04-29T16:00:37Z","timestamp":1745942437000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-35722-0_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642357213","9783642357220"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-35722-0_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}