Computing Optimal Strategies for a Search Game in Discrete Locations

2023/05/17 by Jake Clarkson, Clarkson, Jake, Kyle Y. Lin +1
Computer Science · Decision Sciences · #Auction Theory and Applications #FOS: Mathematics #Game Theory and Applications #Optimization and Control (math.OC) #Optimization and Search Problems #Probability (math.PR)

paper · pdf · doi:10.48550/arxiv.2305.10342

openalex publication_date 2023/05/17 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Consider a two-person zero-sum search game between a hider and a searcher. The hider hides among n discrete locations, and the searcher successively visits individual locations until finding the hider. Known to both players, a search at location i takes t_i time units and detects the hider -- if hidden there -- independently with probability α_i, for i=1,…,n. The hider aims to maximize the expected time until detection, while the searcher aims to minimize it. We present an algorithm to compute an optimal strategy for each player. We demonstrate the algorithm's efficiency in a numerical study, in which we also study the characteristics of the optimal hiding strategy.

Related

• A Classical Search Game in Discrete Locations
• Optimal Pure Strategies for a Discrete Search Game
• A review of minimum cost box searching games
• Search Games with Predictions
• Searching for Multiple Objects in Multiple Locations