Name
Abstract | ||
|---|---|---|
Harry hides on an edge of a graph and does not move from there. Sally, starting from a known origin, tries to find him as soon as she can. Harryu0027s goal is to be found as late as possible. At any given time, each edge of the graph is either active or inactive, independently of the other edges, with a known probability of being active. This situation can be modeled as a zero-sum two-person stochastic game. We show that the game has a value and we provide upper and lower bounds for this value. We show that, as the probability of each edge being active goes to 1, the value of the game converges to the value of the deterministic game, where all edges are always active. Finally, by generalizing optimal strategies of the deterministic case, we provide more refined results for trees and Eulerian graphs. |
Year | Venue | DocType |
|---|---|---|
2019 | arXiv: Computer Science and Game Theory | Journal |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tristan Garrec | 1 | 0 | 0.34 |
| Marco Scarsini | 2 | 164 | 33.96 |