{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T18:40:52Z","timestamp":1726512052156},"reference-count":17,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2007,12,1]],"date-time":"2007-12-01T00:00:00Z","timestamp":1196467200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":2091,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2007,12]]},"DOI":"10.1016\/j.tcs.2007.07.047","type":"journal-article","created":{"date-parts":[[2007,8,9]],"date-time":"2007-08-09T11:38:50Z","timestamp":1186659530000},"page":"181-198","source":"Crossref","is-referenced-by-count":18,"title":["Concurrent games with tail objectives"],"prefix":"10.1016","volume":"388","author":[{"given":"Krishnendu","family":"Chatterjee","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2007.07.047_b1","series-title":"QEST\u201904","first-page":"206","article-title":"Trading memory for randomness","author":"Chatterjee","year":"2004"},{"key":"10.1016\/j.tcs.2007.07.047_b2","series-title":"SODA\u201906","article-title":"The complexity of quantitative concurrent parity games","author":"Chatterjee","year":"2006"},{"issue":"2","key":"10.1016\/j.tcs.2007.07.047_b3","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/0890-5401(92)90048-K","article-title":"The complexity of stochastic games","volume":"96","author":"Condon","year":"1992","journal-title":"Information and Computation"},{"issue":"4","key":"10.1016\/j.tcs.2007.07.047_b4","doi-asserted-by":"crossref","first-page":"857","DOI":"10.1145\/210332.210339","article-title":"The complexity of probabilistic verification","volume":"42","author":"Courcoubetis","year":"1995","journal-title":"Journal of the ACM"},{"key":"10.1016\/j.tcs.2007.07.047_b5","unstructured":"L. de Alfaro, Formal verification of probabilistic systems, Ph.D. Thesis, Stanford University, 1997"},{"key":"10.1016\/j.tcs.2007.07.047_b6","series-title":"LICS 00","first-page":"141","article-title":"Concurrent omega-regular games","author":"de Alfaro","year":"2000"},{"key":"10.1016\/j.tcs.2007.07.047_b7","series-title":"STOC 01","first-page":"675","article-title":"Quantitative solution of omega-regular games","author":"de~Alfaro","year":"2001"},{"year":"1995","series-title":"Probability: Theory and Examples","author":"Durrett","key":"10.1016\/j.tcs.2007.07.047_b8"},{"year":"1997","series-title":"Competitive Markov Decision Processes","author":"Filar","key":"10.1016\/j.tcs.2007.07.047_b9"},{"key":"10.1016\/j.tcs.2007.07.047_b10","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1073\/pnas.36.1.48","article-title":"Equilibrium points in n-person games","volume":"36","author":"Nash","year":"1950","journal-title":"Proceedings of the National Academy of Sciences USA"},{"year":"1995","series-title":"Classical Descriptive Set Theory","author":"Kechris","key":"10.1016\/j.tcs.2007.07.047_b11"},{"issue":"4","key":"10.1016\/j.tcs.2007.07.047_b12","doi-asserted-by":"crossref","first-page":"1565","DOI":"10.2307\/2586667","article-title":"The determinacy of Blackwell games","volume":"63","author":"Martin","year":"1998","journal-title":"The Journal of Symbolic Logic"},{"year":"1995","series-title":"Game Theory","author":"Owen","key":"10.1016\/j.tcs.2007.07.047_b13"},{"key":"10.1016\/j.tcs.2007.07.047_b14","doi-asserted-by":"crossref","first-page":"1095","DOI":"10.1073\/pnas.39.10.1095","article-title":"Stochastic games","volume":"39","author":"Shapley","year":"1953","journal-title":"Proceedings of the National Academy of Sciences USA"},{"key":"10.1016\/j.tcs.2007.07.047_b15","series-title":"Beyond Words","first-page":"389","article-title":"Languages, automata, and logic","volume":"vol. 3","author":"Thomas","year":"1997"},{"year":"1947","series-title":"Theory of Games and Economic Behavior","author":"von Neumann","key":"10.1016\/j.tcs.2007.07.047_b16"},{"key":"10.1016\/j.tcs.2007.07.047_b17","unstructured":"W.W. Wadge, Reducibility and determinateness of Baire spaces, Ph.D. Thesis, UC Berkeley, 1984"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397507005804?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397507005804?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,5]],"date-time":"2019-01-05T07:55:54Z","timestamp":1546674954000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397507005804"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,12]]},"references-count":17,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2007,12]]}},"alternative-id":["S0304397507005804"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2007.07.047","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[2007,12]]}}}