On Policies for Single-Leg Revenue Management with Limited Demand Information
From MaRDI portal
Publication:4994151
DOI10.1287/opre.2020.2048zbMath1467.91049arXiv1810.10900OpenAlexW3114472434MaRDI QIDQ4994151
Will Ma, Chung-Piaw Teo, David Simchi-Levi
Publication date: 17 June 2021
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1810.10900
Microeconomic theory (price theory and economic markets) (91B24) Online algorithms; streaming algorithms (68W27)
Cites Work
- An optimal deterministic algorithm for online \(b\)-matching
- From pricing to prophets, and back!
- Toward Robust Revenue Management: Competitive Analysis of Online Booking
- Dynamic Pricing for Nonperishable Products with Demand Learning
- Dynamic Pricing Without Knowing the Demand Function: Risk Bounds and Near-Optimal Algorithms
- Optimal Dynamic Pricing for Perishable Assets with Nonhomogeneous Demand
- Revenue Management with Limited Demand Information
- Prophet Inequalities Made Easy: Stochastic Optimization by Pricing Nonstochastic Inputs
- Relative Entropy, Exponential Utility, and Robust Dynamic Pricing
- Dynamic Pricing and Learning with Finite Inventories
- AdWords and generalized online matching
- Optimal Dynamic Pricing of Inventories with Stochastic Demand over Finite Horizons
- Stochastic regret minimization for revenue management problems with nonstationary demands
- Algorithms for Online Matching, Assortment, and Pricing with Tight Weight-Dependent Competitive Ratios
- Prophet Inequalities with Limited Information
- Matroid prophet inequalities
- Randomized Primal-Dual Analysis of RANKING for Online Bipartite Matching
This page was built for publication: On Policies for Single-Leg Revenue Management with Limited Demand Information
