{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T22:56:14Z","timestamp":1762296974414},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540283096"},{"type":"electronic","value":"9783540319344"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"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":[[2005]]},"DOI":"10.1007\/11539452_33","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T09:54:50Z","timestamp":1127814890000},"page":"428-442","source":"Crossref","is-referenced-by-count":28,"title":["Games Where You Can Play Optimally Without Any Memory"],"prefix":"10.1007","author":[{"given":"Hugo","family":"Gimbert","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wies\u0142aw","family":"Zielonka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"33_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/978-3-540-24597-1_8","volume-title":"FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science","author":"A. Bouquet","year":"2003","unstructured":"Bouquet, A., Serre, O., Walukiewicz, I.: Pushdown games with unboundedness and regular conditions. In: Pandya, P.K., Radhakrishnan, J. (eds.) FSTTCS 2003. LNCS, vol.\u00a02914, pp. 88\u201399. Springer, Heidelberg (2003)"},{"key":"33_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1007\/3-540-45793-3_22","volume-title":"Computer Science Logic","author":"T. Cachat","year":"2002","unstructured":"Cachat, T., Duparc, J., Thomas, W.: Solving pushdown games with a \u03a33 winning condition. In: Bradfield, J.C. (ed.) CSL 2002 and EACSL 2002. LNCS, vol.\u00a02471, pp. 322\u2013336. Springer, Heidelberg (2002)"},{"key":"33_CR3","unstructured":"Chatterjee, K., Henzinger, T.A., Jurdzi\u0144ski, M.: Mean-payoff parity games. In: LICS (2005) (to appear)"},{"key":"33_CR4","unstructured":"Colcombet, T.; Niwi\u0144ki, D.: On the positional determinacy of edge-labeled games (submitted)"},{"key":"33_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-3-540-24730-2_6","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"L. de Alfaro","year":"2004","unstructured":"de Alfaro, L., Faella, M., Henzinger, T.A., Majumdar, R., Stoelinga, M.: Model checking discounted temporal properties. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol.\u00a02988, pp. 77\u201392. Springer, Heidelberg (2004)"},{"key":"33_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1022","DOI":"10.1007\/3-540-45061-0_79","volume-title":"Automata, Languages and Programming","author":"L. de Alfaro","year":"2003","unstructured":"de Alfaro, L., Henzinger, T.A., Majumdar, R.: Discounting the future in systems theory. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 1022\u20131037. Springer, Heidelberg (2003)"},{"key":"33_CR7","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01768705","volume":"8","author":"A. Ehrenfeucht","year":"1979","unstructured":"Ehrenfeucht, A., Mycielski, J.: Positional strategies for mean payoff games. Intern. J. of Game Theory\u00a08, 109\u2013113 (1979)","journal-title":"Intern. J. of Game Theory"},{"key":"33_CR8","first-page":"368","volume-title":"FOCS 1991","author":"E.A. Emerson","year":"1991","unstructured":"Emerson, E.A., Jutla, C.: Tree automata, \u03bc-calculus and determinacy. In: FOCS 1991, pp. 368\u2013377. IEEE Computer Society Press, Los Alamitos (1991)"},{"key":"33_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/978-3-540-30124-0_8","volume-title":"Computer Science Logic","author":"H. Gimbert","year":"2004","unstructured":"Gimbert, H.: Parity and exploration games on infinite graphs. In: Marcinkowski, J., Tarlecki, A. (eds.) CSL 2004. LNCS, vol.\u00a03210, pp. 56\u201370. Springer, Heidelberg (2004)"},{"key":"33_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"686","DOI":"10.1007\/978-3-540-28629-5_53","volume-title":"Mathematical Foundations of Computer Science 2004","author":"H. Gimbert","year":"2004","unstructured":"Gimbert, H., Zielonka, W.: When can you play positionally? In: Fiala, J., Koubek, V., Kratochv\u00edl, J. (eds.) MFCS 2004. LNCS, vol.\u00a03153, pp. 686\u2013697. Springer, Heidelberg (2004)"},{"key":"33_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/978-3-540-24749-4_2","volume-title":"STACS 2004","author":"E. Gr\u00e4del","year":"2004","unstructured":"Gr\u00e4del, E.: Positional determinacy of infinite games. In: Diekert, V., Habib, M. (eds.) STACS 2004. LNCS, vol.\u00a02996, pp. 4\u201318. Springer, Heidelberg (2004)"},{"key":"33_CR12","unstructured":"Mostowski, A.W.: Games with forbidden positions. Technical Report 78, Uniwersytet Gda\u0144ski, Instytut Matematyki (1991)"},{"key":"33_CR13","volume-title":"A Course in Game Theory","author":"M.J. Osborne","year":"2002","unstructured":"Osborne, M.J., Rubinstein, A.: A Course in Game Theory. The MIT Press, Cambridge (2002)"},{"key":"33_CR14","doi-asserted-by":"publisher","first-page":"1095","DOI":"10.1073\/pnas.39.10.1095","volume":"39","author":"L.S. Shapley","year":"1953","unstructured":"Shapley, L.S.: Stochastic games. Proceedings Nat. Acad. of Science USA\u00a039, 1095\u20131100 (1953)","journal-title":"Proceedings Nat. Acad. of Science USA"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2005 \u2013 Concurrency Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11539452_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T16:35:00Z","timestamp":1558283700000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11539452_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540283096","9783540319344"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/11539452_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}