The PDF file you selected should load here if your Web browser has a PDF reader plug-in installed (for example, a recent version of Adobe Acrobat Reader).

Alternatively, you can also download the PDF file directly to your computer, from where it can be opened using a PDF reader. To download the PDF, click the Download link below.

If you would like more information about how to print, save, and work with PDFs, Highwire Press provides a helpful Frequently Asked Questions about PDFs.

Download this PDF file Fullscreen Fullscreen Off

References

  1. Thomas Ferguson. Who solved the Secretary Problem? Statistical Science 4 (1989), 282-289. Math. Review 91k:01011
  2. Nicholas Georgiou, Malgorzata Kuchta, Michal Morayne and Jaroslaw Niemiec. On a universal best choice algorithm for partially ordered sets. Random Structures and Algorithms 32(3) (2008), 263-273. Math. Review 2009b:90120
  3. Jakub Kozik. Dynamic threshold strategy for universal best choice problem. DMTCS Proceedings, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (2010), 439-452. Math. Review number not available.
  4. Michal Morayne. Partial-order analogue of the secretary problem. The binary tree case. Discrete Mathematics 184(1-3) (1998), 165-181. Math. Review 99f:60086
  5. John Preater. The best-choice problem for partially ordered objects. Operations Research Letters 25 (1999), 187-190. Math. Review 2000g:90069
Bookmark and Share


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.