{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:19:55Z","timestamp":1725560395375},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540287025"},{"type":"electronic","value":"9783540318675"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11549345_7","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T14:05:47Z","timestamp":1127829947000},"page":"58-70","source":"Crossref","is-referenced-by-count":3,"title":["An Invitation to Play"],"prefix":"10.1007","author":[{"given":"Wies\u0142aw","family":"Zielonka","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","volume-title":"Studies in Logic and the Foundations of Mathematics","author":"A. Arnold","year":"2001","unstructured":"Arnold, A., Niwi\u0144ski, D.: Rudiments of \u03bc-calculus. In: Studies in Logic and the Foundations of Mathematics, vol.\u00a0146, Elsevier, Amsterdam (2001)"},{"key":"7_CR2","volume-title":"Inequalities for Stochastic Processes (How to gamble if you must)","author":"L.E. Dubins","year":"1976","unstructured":"Dubins, L.E., Savage, L.J.: Inequalities for Stochastic Processes (How to gamble if you must), 2nd edn. Dover Publications, Mineola (1976)","edition":"2"},{"key":"7_CR3","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":"7_CR4","volume-title":"Competitive Markov Decision Processes","author":"J. Filar","year":"1997","unstructured":"Filar, J., Vrieze, K.: Competitive Markov Decision Processes. Springer, Heidelberg (1997)"},{"key":"7_CR5","unstructured":"Gimbert, H., Zielonka, W.: From Markov decision processes to perfect information stochastic games (in preparation)"},{"key":"7_CR6","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: MFCS 2004. LNCS, vol.\u00a03153, pp. 686\u2013697. Springer, Heidelberg (2004)"},{"key":"7_CR7","series-title":"Lecture Notes in Computer Science","volume-title":"CONCUR 2005","author":"H. Gimbert","year":"2005","unstructured":"Gimbert, H., Zielonka, W.: Games where you can play optimally without any memory. In: CONCUR 2005. LNCS, Springer, Heidelberg (2005) (to appear)"},{"key":"7_CR8","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":"7_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-4002-0","volume-title":"Discrete Gambling and Stochastic Games","author":"A.P. Maitra","year":"1996","unstructured":"Maitra, A.P., Sudderth, W.D.: Discrete Gambling and Stochastic Games. Springer, Heidelberg (1996)"},{"key":"7_CR10","unstructured":"Mostowski, A.W.: Games with forbidden positions. Technical Report\u00a078, Uniwersytet Gda\u0144ski, Instytut Matematyki (1991)"},{"key":"7_CR11","series-title":"NATO Science Series C, Mathematical and Physical Sciences","volume-title":"Stochastic Games and Applications","author":"A. Neyman","year":"2004","unstructured":"Neyman, A., Sorin, S. (eds.): Stochastic Games and Applications. NATO Science Series C, Mathematical and Physical Sciences, vol.\u00a0570. Kluwer Academic Publishers, Dordrecht (2004)"},{"key":"7_CR12","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)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11549345_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:58:37Z","timestamp":1619506717000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11549345_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540287025","9783540318675"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/11549345_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}