Skip to main content
SpringerLink
Log in

The Best-or-Worst and the Postdoc problems

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

Abstract

We consider two variants of the secretary problem, the Best-or-Worst and the Postdoc problems, which are closely related. First, we prove that both variants, in their standard form with binary payoff 1 or 0, share the same optimal stopping rule. We also consider additional cost/perquisites depending on the number of interviewed candidates. In these situations the optimal strategies are very different. Finally, we also focus on the Best-or-Worst variant with different payments depending on whether the selected candidate is the best or the worst.

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

  • Babaioff M, Immorlica N, Kleinberg R (2007) Matroids, secretary problems, and online mechanisms. In: Proceedings of the SODA, pp 434–443

  • Bearden JN (2006) A new secretary problem with rank-based selection and cardinal payoffs. J Math Psychol 50:58–59

    Article  MathSciNet  MATH  Google Scholar 

  • Daley DJ, Kendall DG (1965) Stochastic rumours. J Inst Math Appl 1:42–55

    Article  MathSciNet  Google Scholar 

  • Dynkin EB (1963) The optimum choice of the instant for stopping a markov process. Sov Math Dokl 4:627–629

    MATH  Google Scholar 

  • Ferguson TS (1989) Who solved the secretary problem? Stat Sci 4(3):282–296

    Article  MathSciNet  MATH  Google Scholar 

  • Ferguson TS (1992) The best-choice problems with dependent criteria. Contemp Math 25:135–151

    Article  MathSciNet  MATH  Google Scholar 

  • Ferguson TS, Hardwick JP, Tamaki M (1991) Maximizing the duration of owning a relatively best object. In: Ferguson T, Samuels S (eds) Contemporary mathematics: strategies for sequential search and selection in real time, vol 125. American Mathematics Association, Washington, pp 37–58

    Chapter  Google Scholar 

  • Freij R, Wastlund J (2010) Partially ordered secretaries. Electron Commun Probab 15:504–507

    Article  MathSciNet  MATH  Google Scholar 

  • Garrod B, Morris R (2012) The secretary problem on an unknown poset. Random Struct Algorithms 43(4):429–451

    Article  MathSciNet  MATH  Google Scholar 

  • Georgiou N, Kuchta M, Morayne M, Niemiec J (2008) On a universal best choice algorithm for partially ordered sets. Random Struct Algorithms 32:263–273

    Article  MathSciNet  MATH  Google Scholar 

  • Gilbert J, Mosteller F (1966) Recognizing the maximum of a sequence. J Am Stat Assoc 61:35–73

    Article  MathSciNet  Google Scholar 

  • Lebensztayn E, Machado FP, Rodríguez PM (2011) Limit theorems for a general stochastic rumour model. SIAM J Appl Math 71(4):1476–1486

    Article  MathSciNet  MATH  Google Scholar 

  • Lindley DV (1961) Dynamic programming and decision theory. J R Stat Soc Ser C (Appl Stat) 10(1):39–51

    MathSciNet  MATH  Google Scholar 

  • Rose JS (1982) A problem of optimal choice and assignment. Oper Res 30(1):172–181

    Article  MATH  Google Scholar 

  • Soto JA (2011) Matroid secretary problem in the random assignment model. In: Proceedings of the SODA, pp 1275–1284

  • Szajowski K (1982) Optimal choice problem of a-th object. Mat Stos 19:51–65

    MathSciNet  MATH  Google Scholar 

  • Szajowski KA (2009) A rank-based selection with cardinal payoffs and a cost of choice. Sci Math Jpn 69(2):285–293

    MathSciNet  MATH  Google Scholar 

  • Vanderbei RJ (1983) The Postdoc variant of the secretary problem. http://www.princeton.edu/~rvdb/tex/PostdocProblem/PostdocProb.pdf (unpublished)

Download references

Author information

Authors and Affiliations

  1. Departamento de Matemáticas, Universidad de Oviedo, Avda. Calvo Sotelo s/n, 33007, Oviedo, Spain

    L. Bayón, P. Fortuny Ayuso, J. M. Grau & M. M. Ruiz

  2. Centro Universitario de la Defensa de Zaragoza, Ctra. Huesca s/n, 50090, Zaragoza, Spain

    A. M. Oller-Marcén

Authors
  1. L. Bayón
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. P. Fortuny Ayuso
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. J. M. Grau
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. A. M. Oller-Marcén
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. M. M. Ruiz
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to A. M. Oller-Marcén.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Bayón, L., Fortuny Ayuso, P., Grau, J.M. et al. The Best-or-Worst and the Postdoc problems. J Comb Optim 35, 703–723 (2018). https://doi.org/10.1007/s10878-017-0203-4

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-017-0203-4

Keywords

Mathematics Subject Classification

Search

Navigation