{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:19:10Z","timestamp":1759637950593,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540705741"},{"type":"electronic","value":"9783540705758"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-70575-8_58","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T16:07:43Z","timestamp":1218557263000},"page":"711-723","source":"Crossref","is-referenced-by-count":19,"title":["Recursive Stochastic Games with Positive Rewards"],"prefix":"10.1007","author":[{"given":"Kousha","family":"Etessami","sequence":"first","affiliation":[]},{"given":"Dominik","family":"Wojtczak","sequence":"additional","affiliation":[]},{"given":"Mihalis","family":"Yannakakis","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"58_CR1","series-title":"Lecture Notes in Computer Science","volume-title":"CONCUR 2006 \u2013 Concurrency Theory","author":"T. Br\u00e1zdil","year":"2006","unstructured":"Br\u00e1zdil, T., Brozek, V., Forejt, V., Kucera, A.: Reachability in recursive markov decision processes. In: Baier, C., Hermanns, H. (eds.) CONCUR 2006. LNCS, vol.\u00a04137. Springer, Heidelberg (2006)"},{"key":"58_CR2","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/0890-5401(92)90048-K","volume":"96","author":"A. Condon","year":"1992","unstructured":"Condon, A.: The complexity of stochastic games. Inf.&Comp.\u00a096, 203\u2013224 (1992)","journal-title":"Inf.&Comp."},{"key":"58_CR3","doi-asserted-by":"crossref","unstructured":"Condon, A., Melekopoglou, M.: On the complexity of the policy iteration algorithm for stochastic games. ORSA Journal on Computing\u00a06(2) (1994)","DOI":"10.1287\/ijoc.6.2.188"},{"key":"58_CR4","volume-title":"Biological Sequence Analysis: Probabilistic models of Proteins and Nucleic Acids","author":"R. Durbin","year":"1999","unstructured":"Durbin, R., Eddy, S.R., Krogh, A., Mitchison, G.: Biological Sequence Analysis: Probabilistic models of Proteins and Nucleic Acids. Cambridge U. Press, Cambridge (1999)"},{"key":"58_CR5","doi-asserted-by":"crossref","unstructured":"Esparza, J., Ku\u010dera, A., Mayr, R.: Model checking probabilistic pushdown automata. In: LICS, pp. 12\u201321 (2004)","DOI":"10.1109\/LICS.2004.1319596"},{"key":"58_CR6","unstructured":"Esparza, J., Ku\u010dera, A., Mayr, R.: Quantitative analysis of probabilistic pushdown automata: expectations and variances. In: Proc. of 20th IEEE LICS 2005 (2005)"},{"key":"58_CR7","doi-asserted-by":"crossref","unstructured":"Etessami, K., Yannakakis, M.: Recursive markov chains, stochastic grammars, and monotone systems of non-linear equations. In: Proc. of 22nd STACS (2005), \n                        http:\/\/homepages.inf.ed.ac.uk\/kousha\/bib_index.html","DOI":"10.1007\/978-3-540-31856-9_28"},{"key":"58_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/b138445","volume-title":"Automata, Languages and Programming","author":"K. Etessami","year":"2005","unstructured":"Etessami, K., Yannakakis, M.: Recursive markov decision processes and recursive stochastic games. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580. Springer, Heidelberg (2005)"},{"key":"58_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/11672142_52","volume-title":"STACS 2006","author":"K. Etessami","year":"2006","unstructured":"Etessami, K., Yannakakis, M.: Efficient qualitative analysis of classes of recursive markov decision processes and simple stochastic games. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol.\u00a03884. Springer, Heidelberg (2006)"},{"key":"58_CR10","doi-asserted-by":"crossref","unstructured":"Etessami, K., Yannakakis, M.: On the complexity of Nash equilibria and other fixed points. In: Proc. of 48th IEEE FOCS (2007)","DOI":"10.1109\/FOCS.2007.39"},{"key":"58_CR11","doi-asserted-by":"crossref","unstructured":"Etessami, K., Wojtczak, D., Yannakakis, M.: Recursive stochastic games with positive rewards. Tech report EDI-INF-RR-1224 (July 2007)","DOI":"10.1007\/978-3-540-70575-8_58"},{"key":"58_CR12","doi-asserted-by":"crossref","unstructured":"Fagin, R., Karlin, A., Kleinberg, J., Raghavan, P., Rajagopalan, S., Rubinfeld, R., Sudan, M., Tomkins, A.: Random walks with \u201cback buttons\u201d. In: STOC (2000)","DOI":"10.1145\/335305.335362"},{"key":"58_CR13","volume-title":"Competitive Markov Decision Processes","author":"J. Filar","year":"1997","unstructured":"Filar, J., Vrieze, K.: Competitive Markov Decision Processes. Springer, Heidelberg (1997)"},{"key":"58_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74915-8_6","volume-title":"Computer Science Logic","author":"T. Gawlitza","year":"2007","unstructured":"Gawlitza, T., Seidl, H.: Precise relational invariants through strategy iteration. In: Duparc, J., Henzinger, T.A. (eds.) CSL 2007. LNCS, vol.\u00a04646. Springer, Heidelberg (2007)"},{"key":"58_CR15","unstructured":"Gawlitza, T.: Personal communication (April 2008)"},{"key":"58_CR16","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511629136","volume-title":"Branching Processes: Variation, Growth, and Extinction of Populations","author":"P. Haccou","year":"2005","unstructured":"Haccou, P., Jagers, P., Vatutin, V.A.: Branching Processes: Variation, Growth, and Extinction of Populations. Cambridge U. Press, Cambridge (2005)"},{"key":"58_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-51866-9","volume-title":"The Theory of Branching Processes","author":"T.E. Harris","year":"1963","unstructured":"Harris, T.E.: The Theory of Branching Processes. Springer, Heidelberg (1963)"},{"key":"58_CR18","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1287\/mnsc.12.5.359","volume":"12","author":"A. Hoffman","year":"1966","unstructured":"Hoffman, A., Karp, R.: On nonterminating stochastic games. Manag. Sci.\u00a012, 359\u2013370 (1966)","journal-title":"Manag. Sci."},{"issue":"1","key":"58_CR19","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0022-0000(88)90046-3","volume":"37","author":"D.S. Johnson","year":"1988","unstructured":"Johnson, D.S., Papadimitriou, C., Yannakakis, M.: How easy is local search? J. Comput. Syst. Sci.\u00a037(1), 79\u2013100 (1988)","journal-title":"J. Comput. Syst. Sci."},{"key":"58_CR20","unstructured":"Juba, B.: On the hardness of simple stochastic games. Master\u2019s thesis, CMU (2006)"},{"key":"58_CR21","volume-title":"Foundations of Statistical Natural Language Processing","author":"C. Manning","year":"1999","unstructured":"Manning, C., Sch\u00fctze, H.: Foundations of Statistical Natural Language Processing. MIT Press, Cambridge (1999)"},{"key":"58_CR22","doi-asserted-by":"publisher","first-page":"1565","DOI":"10.2307\/2586667","volume":"63","author":"D.A. Martin","year":"1998","unstructured":"Martin, D.A.: Determinacy of Blackwell games. J. Sym. Log.\u00a063, 1565\u20131581 (1998)","journal-title":"J. Sym. Log."},{"volume-title":"Stochastic Games and Applications","year":"2003","key":"58_CR23","unstructured":"Neyman, A., Sorin, S. (eds.): Stochastic Games and Applications. Kluwer, Dordrecht (2003)"},{"key":"58_CR24","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1287\/mnsc.23.2.117","volume":"23","author":"S. Pliska","year":"1976","unstructured":"Pliska, S.: Optimization of multitype branching processes. Management Sci.\u00a023, 117\u2013124 (1976)","journal-title":"Management Sci."},{"key":"58_CR25","doi-asserted-by":"publisher","DOI":"10.1002\/9780470316887","volume-title":"Markov Decision Processes","author":"M.L. Puterman","year":"1994","unstructured":"Puterman, M.L.: Markov Decision Processes. Wiley, Chichester (1994)"},{"issue":"4","key":"58_CR26","doi-asserted-by":"publisher","first-page":"582","DOI":"10.1287\/moor.7.4.582","volume":"7","author":"U. Rothblum","year":"1982","unstructured":"Rothblum, U., Whittle, P.: Growth optimality for branching Markov decision chains. Math. Oper. Res.\u00a07(4), 582\u2013601 (1982)","journal-title":"Math. Oper. Res."},{"key":"58_CR27","doi-asserted-by":"publisher","first-page":"1635","DOI":"10.1214\/aoms\/1177697379","volume":"40","author":"A.F. Veinott","year":"1969","unstructured":"Veinott, A.F.: Discrete dynamic programming with sensitive discount optimality criteria. Ann. Math. Statist.\u00a040, 1635\u20131660 (1969)","journal-title":"Ann. Math. Statist."},{"key":"58_CR28","unstructured":"Wojtczak, D., Etessami, K.: Premo: an analyzer for probabilistic recursive models. In: Proc. of TACAS (2007), \n                        http:\/\/groups.inf.ed.ac.uk\/premo\/"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70575-8_58","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,2]],"date-time":"2024-05-02T03:30:35Z","timestamp":1714620635000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-70575-8_58"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540705741","9783540705758"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70575-8_58","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}