Fast or Slow: Search in Discrete Locations with Two Search Modes

References

• Alpern S, Gal S (2003) The Theory of Search Games and Rendezvous (Kluwer Academic Publishers, Norwell, MA).Google Scholar
• Alpern S, Lidbetter T (2015) Optimal trade-off between speed and acuity when searching for a small object. Oper. Res. 63(1):122–133.Link, Google Scholar
• Alpern S, Fokkink R, Gasieniec L, Lindelauf R, Subrahmanian VS, eds. (2013) Search Theory (Springer-Verlag, New York).Crossref, Google Scholar
• Black WL (1965) Discrete sequential search. Inform. Control 8(2):159–162.Crossref, Google Scholar
• Chew MC (1967) A sequential search procedure. Ann. Math. Statist. 38(2):494–502.Crossref, Google Scholar
• Chew MC Jr (1973) Optimal stopping in a discrete search problem. Oper. Res. 21(3):741–747.Link, Google Scholar
• Cowan W, Katehakis MN (2015) Multi-armed bandits under general depreciation and commitment. Probab. Engrg. Inform. Sci. 29(1):51–76.Crossref, Google Scholar
• Gittins J, Glazebrook K, Weber R (2011) Multi-Armed Bandit Allocation Indices (Wiley, Chichester, UK).Crossref, Google Scholar
• Gittins JC (1979) Bandit processes and dynamic allocation indices. J. Roy. Statist. Soc. Series B 41(2):148–177.Google Scholar
• Gittins JC (1989) Multi-Armed Bandit Allocation Indices (Wiley, Chichester, UK).Google Scholar
• Kadane JB (1968) Discrete search and the Neyman-Pearson lemma. J. Math. Anal. Appl. 22(1):156–171.Crossref, Google Scholar
• Kadane JB (1971) Optimal whereabouts search. Oper. Res. 19(4):894–904.Link, Google Scholar
• Kress M, Lin KY, Szechtman R (2008) Optimal discrete search with imperfect specificity. Math. Methods Oper. Res. 68(3):539–549.Crossref, Google Scholar
• Lin KY, Singham DI (2015) Robust search policies against an intelligent evader. Technical report, Naval Postgraduate School, Monterey, CA.Google Scholar
• Lin KY, Singham DI (2016) Finding a hider by an unknown deadline. Oper. Res. Lett. 44(1):25–32.Crossref, Google Scholar
• Matula D (1964) A periodic optimal search. Amer. Math. Monthly 71(1):15–21.Crossref, Google Scholar
• Puterman ML (2014) Markov Decision Processes: Discrete Stochastic Dynamic Programming (Wiley, Hoboken, NJ).Google Scholar
• Ross SM (1969) A problem in optimal search and stop. Oper. Res. 17(6):984–992.Link, Google Scholar
• Shechter SM, Ghassemi F, Gocgun Y, Puterman ML (2015) Technical note: Trading off quick vs. slow actions in optimal search. Oper. Res. 63(2):353–362.Link, Google Scholar
• Stone L (2004) Theory of Optimal Search (INFORMS, Catonsville, MD).Google Scholar
• Washburn AR (2002) Search and Detection, 4th ed. (INFORMS, Catonsville, MD).Google Scholar
• Wegener I (1980) The discrete sequential search problem with nonrandom cost and overlook probabilities. Math. Oper. Res. 5(3):373–380.Link, Google Scholar
• Whittle P (1980) Multi-armed bandits and the gittins index. J. Roy. Statis. Soc. Series B 42(2):143–149.Google Scholar