Blackwell Optimal Strategies in Priority mean-Payoff Games
暂无分享,去创建一个
[1] Thomas Wilke,et al. Automata Logics, and Infinite Games , 2002, Lecture Notes in Computer Science.
[2] Hugo Gimbert,et al. Pure Stationary Optimal Strategies in Markov Decision Processes , 2007, STACS.
[3] Hugo Gimbert,et al. Perfect Information Stochastic Priority Games , 2007, ICALP.
[4] Eugene A. Feinberg,et al. Handbook of Markov Decision Processes , 2002 .
[5] Thomas A. Henzinger,et al. Discounting the Future in Systems Theory , 2003, ICALP.
[6] Henrik Björklund,et al. Memoryless determinacy of parity and mean payoff games: a simple proof , 2004, Theor. Comput. Sci..
[7] Rutherford Aris,et al. Discrete Dynamic Programming , 1965, The Mathematical Gazette.
[8] L. Shapley,et al. Stochastic Games* , 1953, Proceedings of the National Academy of Sciences.
[9] J. Filar,et al. Competitive Markov Decision Processes , 1996 .
[10] Ali Esmaili,et al. Probability and Random Processes , 2005, Technometrics.
[11] Hugo Gimbert,et al. Deterministic Priority Mean-Payoff Games as Limits of Discounted Games , 2006, ICALP.
[12] G. Grimmett,et al. Probability and random processes , 2002 .
[13] D. Blackwell,et al. THE BIG MATCH , 1968, Classics in Game Theory.
[14] Donald A. Martin,et al. The determinacy of Blackwell games , 1998, Journal of Symbolic Logic.
[15] Shashi M. Srivastava,et al. A Course on Borel Sets , 1998, Graduate texts in mathematics.
[16] Hugo Gimbert,et al. Limits of Multi-Discounted Markov Decision Processes , 2007, 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007).
[17] Krishnendu Chatterjee,et al. Mean-payoff parity games , 2005, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05).
[18] Hugo Gimbert,et al. Blackwell-Optimal Strategies in Priority Mean-Payoff Games , 2010, GANDALF.
[19] Robert L. Smith,et al. Introduction to Markov Processes , 2013 .
[21] Hugo Gimbert,et al. Applying Blackwell optimality: priority mean-payoff games as limits of multi-discounted games , 2007, Logic and Automata.