{"year":"2010","alternative_title":["EPTCS"],"date_updated":"2023-09-04T11:47:04Z","department":[{"_id":"KrCh"}],"publication_status":"published","publisher":"EPTCS","page":"22 - 29","type":"conference","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"quality_controlled":"1","language":[{"iso":"eng"}],"publist_id":"2329","external_id":{"arxiv":["1006.1403"]},"date_published":"2010-06-08T00:00:00Z","file_date_updated":"2020-07-14T12:46:17Z","conference":{"name":"GandALF: Games, Automata, Logic, and Formal Verification","end_date":"2010-06-18","start_date":"2010-06-17","location":"Minori, Italy"},"volume":25,"oa_version":"Published Version","status":"public","_id":"3852","has_accepted_license":"1","ddc":["000"],"abstract":[{"text":"We introduce two-level discounted games played by two players on a perfect-information stochastic game graph. The upper level game is a discounted game and the lower level game is an undiscounted reachability game. Two-level games model hierarchical and sequential decision making under uncertainty across different time scales. We show the existence of pure memoryless optimal strategies for both players and an ordered field property for such games. We show that if there is only one player (Markov decision processes), then the values can be computed in polynomial time. It follows that whether the value of a player is equal to a given rational constant in two-level discounted games can be decided in NP intersected coNP. We also give an alternate strategy improvement algorithm to compute the value. ","lang":"eng"}],"doi":"10.4204/EPTCS.25.6","month":"06","date_created":"2018-12-11T12:05:31Z","author":[{"first_name":"Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"last_name":"Majumdar","full_name":"Majumdar, Ritankar","first_name":"Ritankar"}],"pubrep_id":"491","scopus_import":"1","intvolume":"        25","day":"08","title":"Discounting in games across time scales","citation":{"chicago":"Chatterjee, Krishnendu, and Ritankar Majumdar. “Discounting in Games across Time Scales,” 25:22–29. EPTCS, 2010. <a href=\"https://doi.org/10.4204/EPTCS.25.6\">https://doi.org/10.4204/EPTCS.25.6</a>.","short":"K. Chatterjee, R. Majumdar, in:, EPTCS, 2010, pp. 22–29.","ista":"Chatterjee K, Majumdar R. 2010. Discounting in games across time scales. GandALF: Games, Automata, Logic, and Formal Verification, EPTCS, vol. 25, 22–29.","ama":"Chatterjee K, Majumdar R. Discounting in games across time scales. In: Vol 25. EPTCS; 2010:22-29. doi:<a href=\"https://doi.org/10.4204/EPTCS.25.6\">10.4204/EPTCS.25.6</a>","apa":"Chatterjee, K., &#38; Majumdar, R. (2010). Discounting in games across time scales (Vol. 25, pp. 22–29). Presented at the GandALF: Games, Automata, Logic, and Formal Verification, Minori, Italy: EPTCS. <a href=\"https://doi.org/10.4204/EPTCS.25.6\">https://doi.org/10.4204/EPTCS.25.6</a>","ieee":"K. Chatterjee and R. Majumdar, “Discounting in games across time scales,” presented at the GandALF: Games, Automata, Logic, and Formal Verification, Minori, Italy, 2010, vol. 25, pp. 22–29.","mla":"Chatterjee, Krishnendu, and Ritankar Majumdar. <i>Discounting in Games across Time Scales</i>. Vol. 25, EPTCS, 2010, pp. 22–29, doi:<a href=\"https://doi.org/10.4204/EPTCS.25.6\">10.4204/EPTCS.25.6</a>."},"file":[{"access_level":"open_access","relation":"main_file","file_size":74598,"date_created":"2018-12-12T10:12:19Z","file_id":"4937","checksum":"2bdf1e9103710555c6251ca4153cb5e9","creator":"system","date_updated":"2020-07-14T12:46:17Z","content_type":"application/pdf","file_name":"IST-2016-491-v1+1_1006.1403v1.pdf"}]}