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

DOI10.1080/02331934.2015.1080253zbMATH Open1338.90439OpenAlexW2281817905MaRDI QIDQ2810092FDOQ2810092

Authors: Michael Bendersky, Israel David 

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

Recommendations

• The full-information best choice problem with a random number of observations
• Optimal Stopping With Random Horizon With Application to the Full-Information Best-Choice Problem With Random Freeze
• scientific article; zbMATH DE number 1547871
• On optimal choosing of one of the \(k\) best objects.
• scientific article; zbMATH DE number 4104214

zbMATH Keywords

dynamic programmingrandom horizonfixed horizonfull-information secretary problems

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (3)

• Benchmark policies for utility-carrying queues with impatience
• A note on the full-information Poisson arrival selection problem
• Stochastic control for organ donations: a review

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2810092)