Optimal Shopping When the Sales Are on—a Markovian Full-Information Best-Choice Problem

DOI10.1080/15326340701470937zbMath1132.60036OpenAlexW2067257332MaRDI QIDQ5421580

Mahmut Parlar, David Perry, Wolfgang Stadje

Publication date: 24 October 2007

Published in: Stochastic Models (Search for Journal in Brave)

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

zbMATH Keywords

nonhomogeneous Poisson processbest choice problem

Mathematics Subject Classification ID

Continuous-time Markov processes on general state spaces (60J25) Stopping times; optimal stopping problems; gambling theory (60G40)

Related Items (4)

Construction of Nash equilibrium in a game version of Elfving's multiple stopping problem ⋮ Robust best choice problem ⋮ Multiple-stopping problems with random horizon ⋮ The full-information best-choice problem with uniform or gamma horizons

Cites Work

• Unnamed Item
• Embedding optimal selection problems in a Poisson process
• Explicit results for a class of asset-selling problems
• Analysis of heuristic solutions to the best choice problem.
• A new algorithm for the multi-item exponentially discounted optimal selection problem.
• Approximation of optimal stopping problems.
• A Time-dependent Stopping Problem with Application to Live Organ Transplants
• An Optimal Selection Problem Associated with the Poisson Process
• A new continuous-time search model
• A Note on a Continuous-Time Search Model with Several Offer Streams
• A general framework for optimal stopping problems associated with multivariate point processes, and applications
• Optimal stopping and cluster point processes
• On the full information best-choice problem
• The house-selling problem with reward rate criterion
• Approximate Optimal Stopping of Dependent Sequences
• A persistency problem connected with a point process

This page was built for publication: Optimal Shopping When the Sales Are on—a Markovian Full-Information Best-Choice Problem