{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T07:02:06Z","timestamp":1760079726207,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642450297"},{"type":"electronic","value":"9783642450303"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-45030-3_43","type":"book-chapter","created":{"date-parts":[[2013,12,12]],"date-time":"2013-12-12T02:32:52Z","timestamp":1386815572000},"page":"457-467","source":"Crossref","is-referenced-by-count":2,"title":["Approximating the Value of a Concurrent Reachability Game in the Polynomial Time Hierarchy"],"prefix":"10.1007","author":[{"given":"S\u00f8ren Kristoffer Stiil","family":"Frederiksen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter Bro","family":"Miltersen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"43_CR1","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., de Alfaro, L., Henzinger, T.A.: Strategy improvement for concurrent reachability games. In: Third International Conference on the Quantitative Evaluation of Systems, QEST 2006, pp. 291\u2013300. IEEE Computer Society (2006)","DOI":"10.1109\/QEST.2006.48"},{"key":"43_CR2","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)"},{"issue":"3","key":"43_CR3","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1016\/j.tcs.2007.07.008","volume":"386","author":"L. Alfaro de","year":"2007","unstructured":"de Alfaro, L., Henzinger, T.A., Kupferman, O.: Concurrent reachability games. Theor. Comput. Sci.\u00a0386(3), 188\u2013217 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"43_CR4","doi-asserted-by":"crossref","unstructured":"Etessami, K., Yannakakis, M.: Recursive concurrent stochastic games. Logical Methods in Computer Science\u00a04(4) (2008)","DOI":"10.2168\/LMCS-4(4:7)2008"},{"key":"43_CR5","doi-asserted-by":"crossref","unstructured":"Everett, H.: Recursive games. In: Kuhn, H.W., Tucker, A.W. (eds.) Contributions to the Theory of Games Vol. III, vol.\u00a039, Annals of Mathematical Studies. Princeton University Press (1957)","DOI":"10.1515\/9781400882151-004"},{"key":"43_CR6","doi-asserted-by":"crossref","unstructured":"Grassmann, W.K., Taksar, M.I., Heyman, D.P.: Regenerative analysis and steady state distributions for Markov chains. Operations Research, 1107\u20131116 (1985)","DOI":"10.1287\/opre.33.5.1107"},{"key":"43_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-3-642-20712-9_7","volume-title":"Computer Science \u2013 Theory and Applications","author":"K.A. Hansen","year":"2011","unstructured":"Hansen, K.A., Ibsen-Jensen, R., Miltersen, P.B.: The complexity of solving reachability games using value and strategy iteration. In: Kulikov, A., Vereshchagin, N. (eds.) CSR 2011. LNCS, vol.\u00a06651, pp. 77\u201390. Springer, Heidelberg (2011)"},{"key":"43_CR8","doi-asserted-by":"crossref","unstructured":"Hansen, K.A., Koucky, M., Miltersen, P.B.: Winning concurrent reachability games requires doubly exponential patience. In: 24th Annual IEEE Symposium on Logic in Computer Science (LICS 2009), pp. 332\u2013341. IEEE (2009)","DOI":"10.1109\/LICS.2009.44"},{"key":"43_CR9","first-page":"245","volume":"60","author":"C.J. Himmelberg","year":"1976","unstructured":"Himmelberg, C.J., Parthasarathy, T., Raghavan, T.E.S., Vleck, F.S.V.: Existence of p-equilibrium and optimal stationary strategies in stochastic games. Proc. Amer. Math. Soc.\u00a060, 245\u2013251 (1976)","journal-title":"Proc. Amer. Math. Soc."},{"issue":"2","key":"43_CR10","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/0304-3975(91)90200-L","volume":"81","author":"N. Megiddo","year":"1991","unstructured":"Megiddo, N., Papadimitriou, C.H.: On total functions, existence theorems and computational complexity. Theor. Comput. Sci.\u00a081(2), 317\u2013324 (1991)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"43_CR11","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01385743","volume":"65","author":"C.A. O\u2019Cinneide","year":"1993","unstructured":"O\u2019Cinneide, C.A.: Entrywise perturbation theory and error analysis for Markov chains. Numerische Mathematik\u00a065(1), 109\u2013120 (1993)","journal-title":"Numerische Mathematik"},{"key":"43_CR12","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1090\/S0002-9904-1971-12633-2","volume":"77","author":"T. Parthasarathy","year":"1971","unstructured":"Parthasarathy, T.: Discounted and positive stochastic games. Bull. Amer. Math. Soc.\u00a077, 134\u2013136 (1971)","journal-title":"Bull. Amer. Math. Soc."},{"key":"43_CR13","doi-asserted-by":"crossref","unstructured":"Sheskin, T.J.: A Markov chain partitioning algorithm for computing steady state probabilities. Operations Research, 228\u2013235 (1985)","DOI":"10.1287\/opre.33.1.228"},{"key":"43_CR14","doi-asserted-by":"publisher","first-page":"831","DOI":"10.1023\/B:JOTP.0000011995.28536.ef","volume":"16","author":"E. Solan","year":"2003","unstructured":"Solan, E.: Continuity of the value of competitive Markov decision processes. Journal of Theoretical Probability\u00a016, 831\u2013845 (2003)","journal-title":"Journal of Theoretical Probability"},{"key":"43_CR15","first-page":"629","volume-title":"Proceedings International Congress Math.","author":"J.H. Wilkinson","year":"1968","unstructured":"Wilkinson, J.H.: A priori error analysis of algebraic processes. In: Proceedings International Congress Math., pp. 629\u2013639. Izdat. Mir, Moscow (1968)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-45030-3_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T04:24:46Z","timestamp":1746073486000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-45030-3_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642450297","9783642450303"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-45030-3_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}