3 papers
cs.DM2023
Optimal Pure Strategies for a Discrete Search Game
Thuy Bui, Thomas Lidbetter, Kyle Y. Lin
Consider a two-person zero-sum search game between a Hider and a Searcher. The Hider chooses to hide in one of discrete locations (or "boxes") and the Searcher chooses a search…
cs.GT2022
Optimal Patrolling Strategies for Trees and Complete Networks
Thuy Bui, Thomas Lidbetter
We present solutions to a continuous patrolling game played on network. In this zero-sum game, an Attacker chooses a time and place to attack a network for a fixed amount of time.…
cs.DM2020
Continuous Patrolling Games
Steve Alpern, Thuy Bui, Thomas Lidbetter +1
We study a patrolling game played on a network , considered as a metric space. The Attacker chooses a point of (not necessarily a node) to attack during a chosen time interv…