Search Games on Trees with Asymmetric Travel Times

DOI10.1137/090781115zbMath1217.91021OpenAlexW1984499065MaRDI QIDQ3083275

Steven Alpern

Publication date: 21 March 2011

Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/090781115

zbMATH Keywords

treesearch gameasymmetric distance

Mathematics Subject Classification ID

Search theory (90B40) Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24)

Related Items (15)

Optimal Trade-Off Between Speed and Acuity When Searching for a Small Object ⋮ Search games on networks with travelling and search costs and with arbitrary searcher starting points ⋮ Search and delivery man problems: when are depth-first paths optimal? ⋮ Search and rescue in the face of uncertain threats ⋮ Optimal patrolling strategies for trees and complete networks ⋮ Search Games for an Immobile Hider ⋮ A new approach to Gal's theory of search games on weakly Eulerian networks ⋮ Weighted network search games with multiple hidden objects and multiple search teams ⋮ Search for an immobile hider on a stochastic network ⋮ Approximate solutions for expanding search games on general networks ⋮ Searching a Variable Speed Network ⋮ Search for an immobile hider in a known subset of a network ⋮ Control Sequencing in a Game of Identity Pursuit-Evasion ⋮ Search games on a network with travelling and search costs ⋮ Static search games played over graphs and general metric spaces

This page was built for publication: Search Games on Trees with Asymmetric Travel Times