{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:36:28Z","timestamp":1725665788994},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642283314"},{"type":"electronic","value":"9783642283321"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-28332-1_31","type":"book-chapter","created":{"date-parts":[[2012,2,29]],"date-time":"2012-02-29T09:45:36Z","timestamp":1330508736000},"page":"363-376","source":"Crossref","is-referenced-by-count":8,"title":["Nash Equilibria in Concurrent Priced Games"],"prefix":"10.1007","author":[{"given":"Miroslav","family":"Klimo\u0161","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kim G.","family":"Larsen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Filip","family":"\u0160tefa\u0148\u00e1k","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeppe","family":"Thaarup","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"31_CR1","doi-asserted-by":"publisher","first-page":"672","DOI":"10.1145\/585265.585270","volume":"49","author":"R. Alur","year":"2002","unstructured":"Alur, R., Henzinger, T.A., Kupferman, O.: Alternating-time temporal logic. J. ACM\u00a049, 672\u2013713 (2002)","journal-title":"J. ACM"},{"key":"31_CR2","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":"31_CR3","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":"31_CR4","unstructured":"Cormen, T., Leiserson, C., Rivest, R., Stein, C.: Introduction to algorithms, vol.\u00a07, pp. 1162\u20131171. MIT Press and McGraw-Hill Book Company (1976)"},{"key":"31_CR5","doi-asserted-by":"crossref","unstructured":"Felegyhazi, M., Hubaux, J., Buttyan, L.: Nash equilibria of packet forwarding strategies in wireless ad hoc networks. IEEE Transactions on Mobile Computing, 463\u2013476 (2006)","DOI":"10.1109\/TMC.2006.68"},{"issue":"1","key":"31_CR6","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":"31_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1007\/978-3-642-23217-6_32","volume-title":"CONCUR 2011","author":"M. Ummels","year":"2011","unstructured":"Ummels, M., Wojtczak, D.: The Complexity of Nash Equilibria in Limit-Average Games. In: Katoen, J.-P., K\u00f6nig, B. (eds.) CONCUR 2011. LNCS, vol.\u00a06901, pp. 482\u2013496. Springer, Heidelberg (2011)"},{"key":"31_CR8","doi-asserted-by":"crossref","unstructured":"Valk, R., Jantzen, M.: The residue of vector sets with applications to decidability problems in Petri nets. In: Application and Theory of Petri Nets, pp. 234\u2013258 (1984)","DOI":"10.1007\/3-540-15204-0_14"}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-28332-1_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T04:24:25Z","timestamp":1556425465000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-28332-1_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642283314","9783642283321"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-28332-1_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}