Search games with immobile hider

DOI10.1007/BF01240153zbMath0774.90102OpenAlexW1985386569MaRDI QIDQ2366102

J. H. Reijnierse, Jos A. M. Potters

Publication date: 29 June 1993

Published in: International Journal of Game Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01240153

zbMATH Keywords

search gameweakly cyclic graphimmobile hiderquasi-Euler path

Mathematics Subject Classification ID

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

Related Items (16)

Hide-and-seek games on a tree to which Eulerian networks are attached ⋮ A competitive search game with a moving target ⋮ Optimal Trade-Off Between Speed and Acuity When Searching for a Small Object ⋮ On the approximation ratio of the random Chinese postman tour for network search ⋮ Search Games for an Immobile Hider ⋮ Search for an immobile entity on a network ⋮ Network search games with immobile hider, without a designated searcher starting point ⋮ Zero-Sum Two Person Games ⋮ The expanding search ratio of a graph ⋮ A new approach to Gal's theory of search games on weakly Eulerian networks ⋮ Searching symmetric networks with Utilitarian-Postman paths ⋮ 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 ⋮ Static search games played over graphs and general metric spaces

Cites Work

• Search games
• The search game on a network with immobile hider
• Unnamed Item

This page was built for publication: Search games with immobile hider