Winning Concurrent Reachability Games Requires Doubly-Exponential Patience

@article{Hansen2009WinningCR,
  title={Winning Concurrent Reachability Games Requires Doubly-Exponential Patience},
  author={Kristoffer Arnsfelt Hansen and Michal Kouck{\'y} and Peter Bro Miltersen},
  journal={2009 24th Annual IEEE Symposium on Logic In Computer Science},
  year={2009},
  pages={332-341}
}
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 

From This Paper

Figures, tables, and topics from this paper.
18 Citations
15 References
Similar Papers

Similar Papers

Loading similar papers…