Optimal Stopping Problem with Controlled Recall
From MaRDI portal
Publication:4950710
DOI10.1017/S0269964800005076zbMath0968.60038MaRDI QIDQ4950710
Publication date: 2 September 2001
Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)
Search theory (90B40) Dynamic programming (90C39) Stopping times; optimal stopping problems; gambling theory (60G40) Stochastic games, stochastic differential games (91A15)
Related Items
Customer selection problem with profit from a sideline ⋮ Optimal switching strategy between admission control and pricing control policies with two types of customers and search costs ⋮ CUSTOMER SELECTION PROBLEM WITH SEARCH COST, DUE DATE, SIDELINE PROFIT, AND NO WAITING ROOM ⋮ Optimal admission and pricing control problems in service industries with multiple servers and sideline profit ⋮ Optimal search from multiple distributions with infinite horizon ⋮ Optimal admission and pricing control problem with deterministic service times and sideline profit ⋮ Optimal stopping problem with finite-period reservation ⋮ Optimal Stopping for Dynamic Recruitment Problem with Probabilistic Loss of Candidates
Cites Work
- Unnamed Item
- Minimax-optimal stop rules and distributions in secretary problems
- Dynamic programming of some sequential sampling design
- Optimal stopping with sampling cost: The secretary problem
- Job search in a dynamic economy
- Search theory: the case of search with uncertain recall
- Duration of offers, price structure, and the gain from search
- Selecting the best choice in the weighted secretary problem
- The best-choice secretary problem with random freeze on jobs
- Optimal Strategies for Selling an Asset
- Optimal Search
- Optimal Search for the Best Alternative
- Best-choice problems involving uncertainty of selection and recall of observations
- Full-information best-choice problems with recall of observations and uncertainty of selection depending on the observation
- Nested variational inequalities and related optimal starting–stopping problems
- A Problem in Optimal Search and Stop