Bounding the radii of balls meeting every connected component of semi-algebraic sets
Journal of Symbolic Computation
Exact algorithms for solving stochastic games: extended abstract
Proceedings of the forty-third annual ACM symposium on Theory of computing
The complexity of solving reachability games using value and strategy iteration
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Discrete Applied Mathematics
| Hi-index | 0.00 |
We exhibit a deterministic concurrent reachability game PURGATORY$_n$ with $n$ non-terminal positions and a binary choice for both players in every position so that any positional strategy for Player 1 achieving the value of the game within given $\epsilon