Tools to Manage Search Games on Lattices
From MaRDI portal
Publication:2961392
DOI10.1007/978-1-4614-6825-7_3zbMath1356.91022OpenAlexW2269745627MaRDI QIDQ2961392
Noemí Zoroa, Procopio Zoroa, María-José Fernández-Sáez
Publication date: 20 February 2017
Published in: Search Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4614-6825-7_3
Search theory (90B40) Games involving graphs (91A43) Structure theory of lattices (06B05) Positional games (pursuit and evasion, etc.) (91A24)
Related Items (3)
Weighted network search games with multiple hidden objects and multiple search teams ⋮ Approximate solutions for expanding search games on general networks ⋮ Search for an immobile hider in a known subset of a network
Cites Work
- Unnamed Item
- Search games
- On the optimality of a simple strategy for searching graphs
- The theory of search games and rendezvous.
- Raid games across a set with cyclic order
- Patrolling a perimeter
- Weighted search games
- Patrolling Games
- The search value of a network
- Search Games with Mobile and Immobile Hider
- Some games of search on a lattice
This page was built for publication: Tools to Manage Search Games on Lattices