Search for an immobile hider on a stochastic network - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue European Journal of Operational Research Année : 2020

Search for an immobile hider on a stochastic network

Résumé

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. Harry's 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. Finally, by generalizing optimal strategies of the deterministic case, we provide more refined results for trees and Eulerian graphs.
Fichier principal
Vignette du fichier
S0377221719309518.pdf (547.1 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03489798 , version 1 (21-07-2022)

Licence

Paternité - Pas d'utilisation commerciale

Identifiants

Citer

Tristan Garrec, Marco Scarsini. Search for an immobile hider on a stochastic network. European Journal of Operational Research, 2020, 283 (2), pp.783 - 794. ⟨10.1016/j.ejor.2019.11.040⟩. ⟨hal-03489798⟩
23 Consultations
16 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More