{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T21:08:01Z","timestamp":1648674481421},"reference-count":7,"publisher":"Open Publishing Association","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. Proc. Theor. Comput. Sci.","EPTCS"],"DOI":"10.4204\/eptcs.25.6","type":"journal-article","created":{"date-parts":[[2010,6,9]],"date-time":"2010-06-09T06:39:26Z","timestamp":1276065566000},"page":"22-29","source":"Crossref","is-referenced-by-count":0,"title":["Discounting in Games across Time Scales"],"prefix":"10.4204","volume":"25","author":[{"given":"Krishnendu","family":"Chatterjee","sequence":"first","affiliation":[{"name":"IST Austria"}]},{"given":"Rupak","family":"Majumdar","sequence":"additional","affiliation":[{"name":"UCLA"}]}],"member":"2720","published-online":{"date-parts":[[2010,6,9]]},"reference":[{"key":"Con92","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/0890-5401(92)90048-K","article-title":"The Complexity of Stochastic Games","volume":"96(2)","author":"A. Condon","year":"1992","journal-title":"Information and Computation"},{"key":"Con93","series-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1090\/dimacs\/013\/04","article-title":"On Algorithms for Simple Stochastic Games","volume-title":"Advances in Computational Complexity Theory","volume":"13","author":"A. Condon","year":"1993"},{"key":"DJW97","first-page":"99","article-title":"How much memory is needed to win infinite games?","volume-title":"LICS'97","author":"S. Dziembowski","year":"1997"},{"key":"FV97","volume-title":"Competitive Markov Decision Processes","author":"J. Filar","year":"1997"},{"issue":"5","key":"KS81","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1137\/0319039","article-title":"Existence of Value and Randomized Strategies in Zero-sum Discrete-Time Stochastic Dynamic Games","volume":"19","author":"P.R. Kumar","year":"1981","journal-title":"SIAM J. Control and Optimization"},{"issue":"4","key":"Mar98","doi-asserted-by":"crossref","first-page":"1565","DOI":"10.2307\/2586667","article-title":"The determinacy of Blackwell games","volume":"63","author":"D.A. Martin","year":"1998","journal-title":"The Journal of Symbolic Logic"},{"key":"Sha53","doi-asserted-by":"crossref","first-page":"1095","DOI":"10.1073\/pnas.39.10.1953","article-title":"Stochastic Games","volume":"39","author":"L.S. Shapley","year":"1953","journal-title":"Proc. Nat. Acad. Sci. USA"}],"container-title":["Electronic Proceedings in Theoretical Computer Science"],"original-title":[],"language":"en","deposited":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T05:17:01Z","timestamp":1551417421000},"score":1,"resource":{"primary":{"URL":"http:\/\/arxiv.org\/abs\/1006.1403v1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6,9]]},"references-count":7,"URL":"https:\/\/doi.org\/10.4204\/eptcs.25.6","relation":{},"ISSN":["2075-2180"],"issn-type":[{"value":"2075-2180","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,6,9]]}}}