Tristan Garrec
TSE
On search games
Lieu
IBD Salle 16
Îlot Bernard du Bois - Salle 16
AMU - AMSE
5-9 boulevard Maurice Bourdet
13001 Marseille
Date(s)
Jeudi 11 octobre 2018| 12:00 - 13:15
Contact(s)
Mathieu Faure : mathieu.faure[at]univ-amu.fr
Gaëtan Fournier : gaetan.fournier[at]univ-amu.fr
Résumé
In a search game, two players, a searcher and a hider, act on a search space. The searcher typically intends to minimize the time needed to locate the hider, or maximize de probability of finding him in a given time. The searcher chooses a trajectory in the search space and detects the hider when he is sufficiently close to him. We will present variants of search games for which we compute the value and optimal strategies of the players depending on the geometry of the search space.