Screening and hiding versus search
From MaRDI portal
Publication:486938
DOI10.1007/s00186-014-0479-4zbMath1314.91041OpenAlexW2056085911MaRDI QIDQ486938
Andrey Garnaev, Kensaku Kikuta
Publication date: 19 January 2015
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00186-014-0479-4
Search theory (90B40) 2-person games (91A05) Games involving graphs (91A43) Information storage and retrieval of data (68P20) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Positional games (pursuit and evasion, etc.) (91A24)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Search allocation game
- Search game in a rectangle
- The theory of search games and rendezvous.
- Stochastic search in a convex region
- A SEARCHER VERSUS HIDER GAME WITH INCOMPLETE INFORMATION ABOUT SEARCH RESOURCES
- The search game on a network with immobile hider
- Technical note: Find a hidden “treasure”
- Application of the fundamental theorem of games to an example concerning antiballistic missile defense
- Search Games with Mobile and Immobile Hider
- Initial point search on weighted trees
- HIDE-AND-SEAERCH GAME WITH THE RISK CRITERION
- A search game with a protector
- Some games of search on a lattice
This page was built for publication: Screening and hiding versus search
