Screening and hiding versus search
DOI10.1007/S00186-014-0479-4zbMATH Open1314.91041OpenAlexW2056085911MaRDI QIDQ486938FDOQ486938
Authors: 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
Recommendations
Information storage and retrieval of data (68P20) Search theory (90B40) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) 2-person games (91A05) Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24)
Cites Work
- Title not available (Why is that?)
- The theory of search games and rendezvous.
- Search Games with Mobile and Immobile Hider
- Title not available (Why is that?)
- Initial point search on weighted trees
- 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”
- Title not available (Why is that?)
- Application of the fundamental theorem of games to an example concerning antiballistic missile defense
- HIDE-AND-SEAERCH GAME WITH THE RISK CRITERION
- A search game with a protector
- Some games of search on a lattice
- Search allocation game
- Search game in a rectangle
Cited In (5)
- Hide-and-seek game with capacitated locations and imperfect detection
- Two-stage security screening strategies in the face of strategic applicants, congestions and screening errors
- A searcher versus hider game with incomplete information about search resources
- Sorting versus screening: search frictions and competing mechanisms
- The role of deception in a game of `hide and seek'
This page was built for publication: Screening and hiding versus search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q486938)
