The Complexity of Ergodic Mean-payoff Games-Reference-Cited by-同舟云学术

The Complexity of Ergodic Mean-payoff Games

Published:2014 Issue: Volume: Page:122-133
ISSN:0302-9743
Container-title:Automata, Languages, and Programming
language:
Short-container-title:

Author:

Chatterjee Krishnendu,Ibsen-Jensen Rasmus

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-662-43951-7_11

Reference23 articles.

1. ArXiv CoRR (2014), Full version http://arxiv.org/abs/1404.5734

2. Lecture Notes in Mathematics;D. Aldous,1983

3. Bewley, T., Kohlberg, E.: The asymptotic behavior of stochastic games. Math. Op. Res. (1) (1976)

4. Blackwell, D., Ferguson, T.: The big match. AMS 39, 159–163 (1968)

5. Boros, E., Elbassioni, K., Gurvich, V., Makino, K.: A potential reduction algorithm for two-person zero-sum limiting average payoff stochastic games. RUTCOR Research Report 13-2012 (2012)

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Identity Testing for Radical Expressions;Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science;2022-08-02

2. Approximation Schemes for Stochastic Mean Payoff Games with Perfect Information and Few Random Positions;Algorithmica;2017-09-19

3. Value Iteration for Long-Run Average Reward in Markov Decision Processes;Computer Aided Verification;2017

4. A Potential Reduction Algorithm for Two-Person Zero-Sum Mean Payoff Stochastic Games;Dynamic Games and Applications;2016-07-08

5. A Potential Reduction Algorithm for Ergodic Two-Person Zero-Sum Limiting Average Payoff Stochastic Games;Combinatorial Optimization and Applications;2014