Skip to main content
SpringerLink
Log in

Discounted Bayesian search problems with unknown detection probabilities

  • Published:
Mathematical Methods of Operations Research Aims and scope Submit manuscript

Abstract

In this paper we consider three discrete-time discounted Bayesian search problems with an unknown number of objects and uncertainty about the distribution of the objects among the boxes. Moreover, we admit uncertainty about the detection probabilities. The goal is to determine a policy which finds (dependent on the search problem) at least one object or all objects with minimal expected total cost. We give sufficient conditions for the optimality of the greedy policy which has been introduced in Liebig/Rieder (1996). For some examples in which the greedy policy is not optimal we derive a bound for the error.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Assaf D, Zamir S (1985) Optimal sequential search: A Bayesian approach. Ann Stat 13:1213–1221

    Google Scholar 

  • Assaf D, Zamir S (1987) Continuous and discrete search for one of many objects. Oper Res Letters 6:205–209

    Google Scholar 

  • Kimeldorf G, Smith FH (1975) Discrete sequential search for one of many objects. Ann Stat 3:906–915

    Google Scholar 

  • Kimeldorf G, Smith FH (1979) Binomial searching for a random number of multinomially hidden objects. Manage Sci 25:1115–1126

    Google Scholar 

  • Lehnerdt M (1982) On the structure of discrete sequential search problems and of their solutions. Optimization 13:523–557

    Google Scholar 

  • Liebig T, Rieder U (1996) Optimal greedy policies for stochastic control models. Mathem Meth Oper Res 44:115–133

    Google Scholar 

  • Liebig T (1995) Strukturuntersuchungen in Bayesschen Suchproblemen. Dissertation, Universität Ulm

  • Rieder U (1991) Structural results for partially observed control models. ZOR-Mathem Meth Oper Res 35:473–490

    Google Scholar 

  • Sharlin A (1987) Optimal search for one of many objects hidden in two boxes. Eur J Oper Res 32:251–259

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics VII, University of Ulm, 89069, Ulm, Germany

    Thilo Liebig

Authors
  1. Thilo Liebig
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Liebig, T. Discounted Bayesian search problems with unknown detection probabilities. Mathematical Methods of Operations Research 44, 233–254 (1996). https://doi.org/10.1007/BF01194333

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01194333

Key words

Search

Navigation