Fast or slow : search in discrete locations with two search modes
Year of publication: |
2020
|
---|---|
Authors: | Clarkson, Jake ; Glazebrook, Kevin D. ; Lin, Kyle Y. |
Published in: |
Operations research. - Catonsville, MD : INFORMS, ISSN 0030-364X, ZDB-ID 123389-0. - Vol. 68.2020, 2, p. 552-571
|
Subject: | search and surveillance | probability | dynamic programming | Stochastic Models | Bayesian updating | Gittins index | optimal search | speed-accuracy trade-off | stochastic coupling | threshold-type policy | Suchtheorie | Search theory | Dynamische Optimierung | Dynamic programming | Stochastischer Prozess | Stochastic process | Mathematische Optimierung | Mathematical programming | Wahrscheinlichkeitsrechnung | Probability theory | Bayes-Statistik | Bayesian inference | Arbeitsuche | Job search |
-
When to abandon a research project and search for a new one
McCardle, Kevin F., (2018)
-
Optimal investment, heterogeneous consumption, and best time for retirement
Jang, Hyun Jin, (2024)
-
Optimal workflow decisions for investigators in systems with interruptions
Dobson, Gregory, (2013)
- More ...
-
A classical search game in discrete locations
Clarkson, Jake, (2023)
-
A Graph Patrol Problem with Random Attack Times
Lin, Kyle Y., (2013)
-
Sequential attack salvo size is monotonic nondecreasing in both time and inventory level
Kalyanam, Krishna, (2020)
- More ...