Optimal stopping problem with recall cost

DOI10.1016/S0377-2217(98)00013-7zbMath0998.90082MaRDI QIDQ1847165

Byung-Kook Kang

Publication date: 17 November 2002

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

dynamic programming; optimal stopping; recall; reservation value

Mathematics Subject Classification ID

90C39: Dynamic programming

60G40: Stopping times; optimal stopping problems; gambling theory

Related Items

OPTIMAL INVESTMENT STRATEGY VIA INTERVAL ARITHMETIC, Optimal Stopping for Dynamic Recruitment Problem with Probabilistic Loss of Candidates, Optimal, quality-aware scheduling of data consumption in mobile ad hoc networks, Delay-tolerant delivery of quality information in ad hoc networks, 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, Optimal admission and pricing control problem with deterministic service times and sideline profit, Optimal stopping problem with double reservation value property, Optimal stopping problem with finite-period reservation, Consumer search markets with costly revisits, 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

Cites Work

• Unnamed Item
• Dynamic programming of some sequential sampling design
• Search theory: the case of search with uncertain recall
• Duration of offers, price structure, and the gain from search
• OPTIMAL STOPPING PROBLEM WITH UNCERTAIN RECALL