Hide-and-Seek Games on a Network, Using Combinatorial Search Paths

DOI10.1287/opre.2017.1594zbMath1411.91108OpenAlexW2564724695MaRDI QIDQ4598639

Steven Alpern

Publication date: 15 December 2017

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: http://wrap.warwick.ac.uk/84522/7/WRAP-hide-seek-games-combinatorial-paths-Alpern-2017.pdf

zbMATH Keywords

networksearch gamezero sum gamehide-seek

Mathematics Subject Classification ID

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

Related Items (9)

Search and delivery man problems: when are depth-first paths optimal? ⋮ A Multi-Stage Model of Searching for Two Mobile Objects on a Graph ⋮ Solving Zero-Sum Games Using Best-Response Oracles with Applications to Search Games ⋮ A search problem on a bipartite network ⋮ Failure of common knowledge of language in common-interest communication games ⋮ Weighted network search games with multiple hidden objects and multiple search teams ⋮ Search for an immobile hider on a stochastic network ⋮ Search for an immobile hider in a known subset of a network ⋮ Rendezvous search with markers that can be dropped at chosen times

This page was built for publication: Hide-and-Seek Games on a Network, Using Combinatorial Search Paths