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

DOI10.1080/02331934.2015.1080253zbMath1338.90439OpenAlexW2281817905MaRDI QIDQ2810092

Israel David, Michael Bendersky

Publication date: 31 May 2016

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331934.2015.1080253

zbMATH Keywords

dynamic programmingrandom horizonfixed horizonfull-information secretary problems

Mathematics Subject Classification ID

Dynamic programming (90C39) Stopping times; optimal stopping problems; gambling theory (60G40)

Related Items (2)

Stochastic control for organ donations: a review ⋮ Benchmark policies for utility-carrying queues with impatience

Cites Work

• Unnamed Item
• Unnamed Item
• The full-information best choice problem with a random number of observations
• Multiple-stopping problems with random horizon
• A Time-dependent Stopping Problem with Application to Live Organ Transplants
• A new continuous-time search model
• Optimal Shopping When the Sales Are on—a Markovian Full-Information Best-Choice Problem
• A Full-Information Best-Choice Problem with Allowance
• A persistency problem connected with a point process
• Some Problems in the Theory of Optimal Stopping Rules

This page was built for publication: The full-information best-choice problem with uniform or gamma horizons