{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T05:19:12Z","timestamp":1737091152685,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540709176"},{"type":"electronic","value":"9783540709183"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-70918-3_18","type":"book-chapter","created":{"date-parts":[[2007,5,23]],"date-time":"2007-05-23T23:41:23Z","timestamp":1179963683000},"page":"200-211","source":"Crossref","is-referenced-by-count":7,"title":["Pure Stationary Optimal Strategies in Markov Decision Processes"],"prefix":"10.1007","author":[{"given":"Hugo","family":"Gimbert","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0304-4149(87)90055-X","volume":"26","author":"K.-J. Bierth","year":"1987","unstructured":"Bierth, K.-J.: An expected average reward criterion. Stochastic Processes and Applications\u00a026, 133\u2013140 (1987)","journal-title":"Stochastic Processes and Applications"},{"key":"18_CR2","volume-title":"Stochastic Optimal Control:\u00a0The Discrete-Time Case","author":"D. Bertsekas","year":"1978","unstructured":"Bertsekas, D., Shreve, S.: Stochastic Optimal Control:\u00a0The Discrete-Time Case. Academic Press, London (1978)"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Bj\u00f6rklund, H., Sandberg, S., Vorobyov, S.: Memoryless determinacy of parity and mean payoff games: a simple proof (2004)","DOI":"10.1016\/S0304-3975(03)00427-4"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Chatterjee, K.: Concurrent games with tail objectives. In: CSL\u201906 (2006)","DOI":"10.1007\/11874683_17"},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Henzinger, T.A., Jurdzinski, M.: Mean-payoff parity games. In: LICS\u201905, pp. 178\u2013187 (2005)","DOI":"10.1109\/LICS.2005.26"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Majumdar, R., Henzinger, T.A.: Markov decision processes with multiple objectives. In: STACS\u201906, pp. 325\u2013336 (2006)","DOI":"10.1007\/11672142_26"},{"issue":"1-3","key":"18_CR7","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1016\/j.tcs.2005.10.046","volume":"352","author":"T. Colcombet","year":"2006","unstructured":"Colcombet, T., Niwinski, D.: On the positional determinacy of edge-labeled games. Theor. Comput. Sci.\u00a0352(1-3), 190\u2013196 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"18_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/BFb0032043","volume-title":"Automata, Languages and Programming","author":"C. Courcoubetis","year":"1990","unstructured":"Courcoubetis, C., Yannakakis, M.: Markov decision processes and regular events. In: Paterson, M.S. (ed.) Automata, Languages and Programming. LNCS, vol.\u00a0443, pp. 336\u2013349. Springer, Heidelberg (1990)"},{"key":"18_CR9","unstructured":"de Alfaro, L.: Formal Verification of Probabilistic Systems. PhD thesis, Stanford University (Dec. 1997)"},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"de Alfaro, L.: How to specify and verify the long-run average behavior of probabilistic systems. In: LICS, pp. 454\u2013465 (1998)","DOI":"10.1109\/LICS.1998.705679"},{"key":"18_CR11","volume-title":"Competitive Markov Decision Processes","author":"J. Filar","year":"1997","unstructured":"Filar, J., Vrieze, K.: Competitive Markov Decision Processes. Springer, Heidelberg (1997)"},{"key":"18_CR12","unstructured":"Gilette, D.: Stochastic games with zero stop probabilities (1957)"},{"key":"18_CR13","unstructured":"Gimbert, H.: Pure stationary optimal strategies in Markov decision processes. http:\/\/www.lix.polytechnique.fr\/~gimbert\/recherche\/mdp_gimbert.ps"},{"key":"18_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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":"18_CR15","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":"18_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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":"18_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1007\/11539452_33","volume-title":"CONCUR 2005 \u2013 Concurrency Theory","author":"H. Gimbert","year":"2005","unstructured":"Gimbert, H., Zielonka, W.: Games where you can play optimally without any memory. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol.\u00a03653, pp. 428\u2013442. Springer, Heidelberg (2005)"},{"key":"18_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/11787006_27","volume-title":"Automata, Languages and Programming","author":"H. Gimbert","year":"2006","unstructured":"Gimbert, H., Zielonka, W.: Deterministic priority mean-payoff games as limits of discounted games. In: Bugliesi, M., et al. (eds.) ICALP 2006. LNCS, vol.\u00a04052, Springer, Heidelberg (2006)"},{"key":"18_CR19","series-title":"Lecture Notes in Computer Science","volume-title":"Automata, Languages and Programming","author":"E. Kopczy\u0144ski","year":"2006","unstructured":"Kopczy\u0144ski, E.: Half-positional determinacy of infinite games. In: Bugliesi, M., et al. (eds.) ICALP 2006. LNCS, vol.\u00a04052, Springer, Heidelberg (2006)"},{"key":"18_CR20","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":"18_CR21","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1007\/978-94-010-0189-2","volume-title":"Stochastic games and applications","author":"A. Neyman","year":"2003","unstructured":"Neyman, A., Sorin, S.: Stochastic games and applications, p. 2. Kluwer Academic Publishers, Dordrecht (2003)"},{"key":"18_CR22","doi-asserted-by":"crossref","DOI":"10.1002\/9780470316887","volume-title":"Markov Decision Processes: Discrete Stochastic Dynamic Programming","author":"M.L. Puterman","year":"1994","unstructured":"Puterman, M.L.: Markov Decision Processes: Discrete Stochastic Dynamic Programming. John Wiley & Sons, Inc., New York (1994)"},{"key":"18_CR23","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 of the National Academy of Science USA\u00a039, 1095\u20131100 (1953)","journal-title":"Proceedings of the National Academy of Science USA"},{"key":"18_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/3-540-60275-5","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":"18_CR25","doi-asserted-by":"crossref","unstructured":"Thuijsman, F., Vrieze, O.J.: The Bad Match, a total reward stochastic game, vol. 9, pp. 93\u201399 (1987)","DOI":"10.1007\/BF01732644"}],"container-title":["Lecture Notes in Computer Science","STACS 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70918-3_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T15:49:09Z","timestamp":1737042549000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70918-3_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540709176","9783540709183"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70918-3_18","relation":{},"subject":[]}}