The full-information best-choice problem with uniform or gamma horizons

Michael Bendersky, Israel David

Research output: Contribution to journalArticlepeer-review

3 Scopus citations

Abstract

A decision-maker has to choose one from among a Poisson stream of i.i.d. bids, with no recall. The stream stops at a random time with a uniform (in the first case) or Erlang (in the second case) distribution. We solve the problem explicitly for maximal expected gain for bids that may take on any finite number of values. A fast procedure to solve the problem for fixed horizon is presented as well.

Original languageEnglish
Pages (from-to)765-778
Number of pages14
JournalOptimization
Volume65
Issue number4
DOIs
StatePublished - 2 Apr 2016

Keywords

  • dynamic programming
  • fixed horizon
  • full-information secretary problems
  • random horizon

Fingerprint

Dive into the research topics of 'The full-information best-choice problem with uniform or gamma horizons'. Together they form a unique fingerprint.

Cite this