Publications [#302359] of Rong Ge

Papers Published

1. Dai, D; Ge, R, New results on simple stochastic games, Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, vol. 5878 LNCS (December, 2009), pp. 1014-1023, Springer Berlin Heidelberg, ISSN 0302-9743 [doi]
   (last updated on 2026/01/15)

   Abstract:
   We study the problem of solving simple stochastic games, and give both an interesting new algorithm and a hardness result. We show a reduction from fine approximation of simple stochastic games to coarse approximation of a polynomial sized game, which can be viewed as an evidence showing the hardness to approximate the value of simple stochastic games. We also present a randomized algorithm that runs in time, where is the number of RANDOM vertices and ignores polynomial terms. This algorithm is the fastest known algorithm when and and it works for general (non-stopping) simple stochastic games. © 2009 Springer-Verlag Berlin Heidelberg.