乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T00:47:27Z","timestamp":1725670047325},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642287282"},{"type":"electronic","value":"9783642287299"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","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-28729-9_20","type":"book-chapter","created":{"date-parts":[[2012,3,22]],"date-time":"2012-03-22T16:47:40Z","timestamp":1332434860000},"page":"301-315","source":"Crossref","is-referenced-by-count":16,"title":["Concurrent Games with Ordered Objectives"],"prefix":"10.1007","author":[{"given":"Patricia","family":"Bouyer","sequence":"first","affiliation":[]},{"given":"Romain","family":"Brenguier","sequence":"additional","affiliation":[]},{"given":"Nicolas","family":"Markey","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Ummels","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"5","key":"20_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(5), 672\u2013713 (2002)","journal-title":"J. ACM"},{"key":"20_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":"20_CR3","unstructured":"Bouyer, P., Brenguier, R., Markey, N., Ummels, M.: Concurrent games with ordered objectives. Research Report LSV-11-22, LSV, ENS Cachan, France (2011)"},{"key":"20_CR4","series-title":"LIPIcs","first-page":"375","volume-title":"FSTTCS 2011","author":"P. Bouyer","year":"2011","unstructured":"Bouyer, P., Brenguier, R., Markey, N., Ummels, M.: Nash equilibria in concurrent games with B\u00fcchi objectives. In: FSTTCS 2011. LIPIcs, vol.\u00a013, pp. 375\u2013386. Leibniz-Zentrum f\u00fcr Informatik, LZI (2011)"},{"key":"20_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/978-3-540-30124-0_6","volume-title":"Computer Science Logic","author":"K. Chatterjee","year":"2004","unstructured":"Chatterjee, K., Majumdar, R., Jurdzi\u0144ski, M.: On Nash Equilibria in Stochastic Games. In: Marcinkowski, J., Tarlecki, A. (eds.) CSL 2004. LNCS, vol.\u00a03210, pp. 26\u201340. Springer, Heidelberg (2004)"},{"key":"20_CR6","unstructured":"Henzinger, T.A.: Games in system design and verification. In: TARK 2005, pp. 1\u20134 (2005)"},{"key":"20_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/11549345_43","volume-title":"Mathematical Foundations of Computer Science 2005","author":"P. Hunter","year":"2005","unstructured":"Hunter, P., Dawar, A.: Complexity Bounds for Regular Games. In: Jedrzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol.\u00a03618, pp. 495\u2013506. Springer, Heidelberg (2005)"},{"issue":"3","key":"20_CR8","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/S0020-0190(98)00150-1","volume":"68","author":"M. Jurdzinski","year":"1998","unstructured":"Jurdzinski, M.: Deciding the winner in parity games is in UP \u2229 co-UP. Inf. Process. Lett.\u00a068(3), 119\u2013124 (1998)","journal-title":"Inf. Process. Lett."},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"Laroussinie, F., Markey, N., Oreiby, G.: On the expressiveness and complexity of\u00a0ATL. Logicical Methods in Computer Science\u00a04(2) (2008)","DOI":"10.2168\/LMCS-4(2:7)2008"},{"issue":"2","key":"20_CR10","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0168-0072(93)90036-D","volume":"65","author":"R. McNaughton","year":"1993","unstructured":"McNaughton, R.: Infinite games played on finite graphs. Annals of Pure and Applied Logic\u00a065(2), 149\u2013184 (1993)","journal-title":"Annals of Pure and Applied Logic"},{"issue":"1","key":"20_CR11","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1073\/pnas.36.1.48","volume":"36","author":"J.F. Nash Jr.","year":"1950","unstructured":"Nash Jr., J.F.: Equilibrium points in n-person games. Proc. National Academy of Sciences of the\u00a0USA\u00a036(1), 48\u201349 (1950)","journal-title":"Proc. National Academy of Sciences of the\u00a0USA"},{"issue":"4","key":"20_CR12","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/S0020-0190(02)00285-5","volume":"84","author":"J. Neumann","year":"2002","unstructured":"Neumann, J., Szepietowski, A., Walukiewicz, I.: Complexity of weak acceptance conditions in tree automata. Inf. Process. Lett.\u00a084(4), 181\u2013187 (2002)","journal-title":"Inf. Process. Lett."},{"key":"20_CR13","unstructured":"Papadimitriou, C.H.: Complexity Theory. Addison-Wesley (1994)"},{"key":"20_CR14","unstructured":"Paul, S., Simon, S.: Nash equilibrium in generalised Muller games. In: FSTTCS 2009. LIPIcs, vol.\u00a04, pp. 335\u2013346. LZI (2010)"},{"key":"20_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/3-540-45657-0_5","volume-title":"Computer Aided Verification","author":"W. Thomas","year":"2002","unstructured":"Thomas, W.: Infinite Games and Verification (Extended abstract of a tutorial). In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol.\u00a02404, pp. 58\u201364. Springer, Heidelberg (2002)"},{"key":"20_CR16","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.M. (ed.) FOSSACS 2008. LNCS, vol.\u00a04962, pp. 20\u201334. Springer, Heidelberg (2008)"},{"key":"20_CR17","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 \u2013 Concurrency Theory","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 \u2013 Concurrency Theory. LNCS, vol.\u00a06901, pp. 482\u2013496. Springer, Heidelberg (2011)"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computational Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-28729-9_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T20:45:06Z","timestamp":1558298706000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-28729-9_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642287282","9783642287299"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-28729-9_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}