2022/04/23 by Daniel Freund, Freund, Daniel, Jiayu Kamessi Zhao +1
Business, Management and Accounting · Computer Science · Decision Sciences · #Advanced Bandit Algorithms Research #FOS: Mathematics #Optimization and Control (math.OC) #Optimization and Search Problems #Supply Chain and Inventory Management
paper · pdf · doi:10.48550/arxiv.2204.11148
openalex publication_date 2022/04/23 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We study a classical problem in revenue management: quantity-based single-resource revenue management with no-shows. In this problem, a firm observes a sequence of T customers requesting a service. Each arrival is drawn independently from a known distribution of k different types, and the firm needs to decide irrevocably whether to accept or reject requests in an online fashion. The firm has a capacity of resources B, and wants to maximize its profit. Each accepted service request yields a type-dependent revenue and has a type-dependent probability of requiring a resource once all arrivals have occurred (or, be a no-show). If the number of accepted arrivals that require a resource at the end of the horizon is greater than B, the firm needs to pay a fixed compensation for each service request that it cannot fulfill. With a clairvoyant, that knows all arrivals ahead of time, as a benchmark, we provide an algorithm with a uniform additive loss bound, i.e., its expected loss is independent of T. This improves upon prior works achieving Ω(√(T)) guarantees.