# 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

18 Citations
15 References
Similar Papers

#### References

##### Publications referenced by this paper.
Showing 1-10 of 15 references

## Recursive games

• H. Everett
• Contributions to the Theory of Games Vol. III…
• 1957
Highly Influential
9 Excerpts
Highly Influential
4 Excerpts
2 Excerpts