IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v19y1971i4p894-904.html
   My bibliography  Save this article

Optimal Whereabouts Search

Author

Listed:
  • Joseph B. Kadane

    (Center for Naval Analyses, Arlington, Virginia)

Abstract

An optimal whereabouts search maximizes the probability of correctly stating, at the end of a search costing no more than some budget C , which box contains the object. This can be accomplished either by finding the object in the search or by guessing, at the end of an unsuccessful search, which box contains the object. Generalizing work of Tognetti, this paper shows that an optimal whereabouts search never searches the box to be guessed, and gives an algorithm for finding an optimal whereabouts-search strategy. Finally, whereabouts search is compared to a similar problem proposed by Bellman.

Suggested Citation

  • Joseph B. Kadane, 1971. "Optimal Whereabouts Search," Operations Research, INFORMS, vol. 19(4), pages 894-904, August.
    • Handle: RePEc:inm:oropre:v:19:y:1971:i:4:p:894-904
    DOI: 10.1287/opre.19.4.894
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.19.4.894
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.19.4.894?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Joseph Kadane, 2015. "Optimal discrete search with technological choice," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 81(3), pages 317-336, June.
    2. Wilson, Kurt E. & Szechtman, Roberto & Atkinson, Michael P., 2011. "A sequential perspective on searching for static targets," European Journal of Operational Research, Elsevier, vol. 215(1), pages 218-226, November.
    3. Baycik, N. Orkun & Sharkey, Thomas C. & Rainwater, Chase E., 2020. "A Markov Decision Process approach for balancing intelligence and interdiction operations in city-level drug trafficking enforcement," Socio-Economic Planning Sciences, Elsevier, vol. 69(C).
    4. Joseph B. Kadane, 2015. "Optimal discrete search with technological choice," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 81(3), pages 317-336, June.
    5. Jake Clarkson & Kevin D. Glazebrook & Kyle Y. Lin, 2020. "Fast or Slow: Search in Discrete Locations with Two Search Modes," Operations Research, INFORMS, vol. 68(2), pages 552-571, March.
    6. Stanley J. Benkoski & Michael G. Monticino & James R. Weisinger, 1991. "A survey of the search theory literature," Naval Research Logistics (NRL), John Wiley & Sons, vol. 38(4), pages 469-494, August.
    7. Michael Atkinson & Moshe Kress & Rutger-Jan Lange, 2016. "When Is Information Sufficient for Action? Search with Unreliable yet Informative Intelligence," Operations Research, INFORMS, vol. 64(2), pages 315-328, April.
    8. Yan Xia & Rajan Batta & Rakesh Nagi, 2017. "Controlling a Fleet of Unmanned Aerial Vehicles to Collect Uncertain Information in a Threat Environment," Operations Research, INFORMS, vol. 65(3), pages 674-692, June.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:19:y:1971:i:4:p:894-904. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.