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

Michael Bendersky; Israel David

doi:10.1080/02331934.2015.1080253

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

Michael Bendersky, Israel David

Department of Industrial Engineering and Management

Research output: Contribution to journal › Article › peer-review

4 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 language	English
Pages (from-to)	765-778
Number of pages	14
Journal	Optimization
Volume	65
Issue number	4
DOIs	https://doi.org/10.1080/02331934.2015.1080253
State	Published - 2 Apr 2016

Keywords

dynamic programming
fixed horizon
full-information secretary problems
random horizon

ASJC Scopus subject areas

Control and Optimization
Management Science and Operations Research
Applied Mathematics

Access to Document

10.1080/02331934.2015.1080253

Cite this

@article{a6025df091c14744b0e97d0f9dfcc2fc,

title = "The full-information best-choice problem with uniform or gamma horizons",

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.",

keywords = "dynamic programming, fixed horizon, full-information secretary problems, random horizon",

author = "Michael Bendersky and Israel David",

note = "Publisher Copyright: {\textcopyright} 2015 Taylor & Francis.",

year = "2016",

month = apr,

day = "2",

doi = "10.1080/02331934.2015.1080253",

language = "English",

volume = "65",

pages = "765--778",

journal = "Optimization",

issn = "0233-1934",

publisher = "Taylor and Francis Ltd.",

number = "4",

}

TY - JOUR

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

AU - Bendersky, Michael

AU - David, Israel

PY - 2016/4/2

Y1 - 2016/4/2

N2 - 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.

AB - 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.

KW - dynamic programming

KW - fixed horizon

KW - full-information secretary problems

KW - random horizon

UR - http://www.scopus.com/inward/record.url?scp=84957838208&partnerID=8YFLogxK

U2 - 10.1080/02331934.2015.1080253

DO - 10.1080/02331934.2015.1080253

M3 - Article

AN - SCOPUS:84957838208

SN - 0233-1934

VL - 65

SP - 765

EP - 778

JO - Optimization

JF - Optimization

IS - 4

ER -

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

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this