Memoryless Strategies in Stochastic Reachability Games
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866909082016808960 |
|---|---|
| author | Kiefer, Stefan Mayr, Richard Shirmohammadi, Mahsa Totzke, Patrick |
| author_facet | Kiefer, Stefan Mayr, Richard Shirmohammadi, Mahsa Totzke, Patrick |
| contents | We study concurrent stochastic reachability games played on finite graphs. Two players, Max and Min, seek respectively to maximize and minimize the probability of reaching a set of target states. We prove that Max has a memoryless strategy that is optimal from all states that have an optimal strategy. Our construction provides an alternative proof of this result by Bordais, Bouyer and Le Roux, and strengthens it, as we allow Max's action sets to be countably infinite. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2401_13390 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Memoryless Strategies in Stochastic Reachability Games Kiefer, Stefan Mayr, Richard Shirmohammadi, Mahsa Totzke, Patrick Logic in Computer Science Computer Science and Game Theory Probability We study concurrent stochastic reachability games played on finite graphs. Two players, Max and Min, seek respectively to maximize and minimize the probability of reaching a set of target states. We prove that Max has a memoryless strategy that is optimal from all states that have an optimal strategy. Our construction provides an alternative proof of this result by Bordais, Bouyer and Le Roux, and strengthens it, as we allow Max's action sets to be countably infinite. |
| title | Memoryless Strategies in Stochastic Reachability Games |
| topic | Logic in Computer Science Computer Science and Game Theory Probability |
| url | https://arxiv.org/abs/2401.13390 |