A search game when a search path is given

DOI10.1016/S0377-2217(99)00120-4zbMath0960.90044MaRDI QIDQ1576344

Koji Iida, Ryusuke Hohzaki

Publication date: 14 August 2000

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

complexitygame theorydynamic programmingmilitarysearch theory

Mathematics Subject Classification ID

Game theory (91A99) Search theory (90B40) Dynamic programming (90C39)

Related Items (4)

Search allocation game ⋮ A Generalization of the Multi-Stage Search Allocation Game ⋮ A Search Game with a Strategy of Energy Supply for Target ⋮ Static search games played over graphs and general metric spaces

Cites Work

• Unnamed Item
• Unnamed Item
• Theory of optimal search
• Search-Evasion Game in a Fixed Region
• Technical Note—The Complexity of the Optimal Searcher Path Problem
• PATH CONSTRAINED SEARCH PROBLEM WITH REWARD CRITERION
• An Optimal Branch-and-Bound Procedure for the Constrained Path, Moving Target Search Problem

This page was built for publication: A search game when a search path is given