On the optimality of a simple strategy for searching graphs
From MaRDI portal
Publication:1414372
DOI10.1007/s001820000056zbMath1060.91035OpenAlexW2068873264MaRDI QIDQ1414372
Publication date: 20 November 2003
Published in: International Journal of Game Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s001820000056
Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24) Eulerian and Hamiltonian graphs (05C45)
Related Items (20)
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 ⋮ Scheduling search procedures: The wheel of fortune ⋮ Search and rescue in the face of uncertain threats ⋮ Patrolling a Border ⋮ On the approximation ratio of the random Chinese postman tour for network search ⋮ Search Games: A Review ⋮ Search Games for an Immobile Hider ⋮ Tools to Manage Search Games on Lattices ⋮ Solving Zero-Sum Games Using Best-Response Oracles with Applications to Search Games ⋮ Search for an immobile entity on a network ⋮ Network search games with immobile hider, without a designated searcher starting point ⋮ The expanding search ratio of a graph ⋮ Linear search by a pair of distinct-speed robots ⋮ A new approach to Gal's theory of search games on weakly Eulerian networks ⋮ Search for an immobile hider on a stochastic network ⋮ Ranking hypotheses to minimize the search cost in probabilistic inference models ⋮ 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
This page was built for publication: On the optimality of a simple strategy for searching graphs
