Author:
Boros Endre,Elbassioni Khaled,Gurvich Vladimir,Makino Kazuhisa
Publisher
Springer Science and Business Media LLC
Reference37 articles.
1. Andersson, D., Miltersen, P.B.: The complexity of solving stochastic games on graphs. In: Proceedings of the 20th International Symposium on Algorithms and Computation (ISAAC), pp. 112–121 (2009)
2. Boros, E., Elbassioni, K., Gurvich, V., Makino, K.: A pumping algorithm for ergodic stochastic mean payoff games with perfect information. In: Proceedings of the 14th International Conference on Integer Programming and Combinatorial Optimization (IPCO), pp. 341–354 (2010)
3. Boros, E., Elbassioni, K., Gurvich, V., Makino, K.: On canonical forms for zero-sum stochastic mean payoff games. Dyn. Games Appl. 3(2), 128–161 (2013)
4. Boros, E., Elbassioni, K.M., Gurvich, V., Makino, K.: A pseudo-polynomial algorithm for mean payoff stochastic games with perfect information and a few random positions. In: Proceedings of the 40th International Colloquium on Automata, Languages, and Programming (ICALP) Part I, pp. 220–231 (2013)
5. Boros, E., Elbassioni, K., Gurvich, V., Makino, K.: A pseudo-polynomial algorithm for mean payoff stochastic games with perfect information and few random positions. CoRR, arXiv:1508.03431 (2015)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献