Online Resource Allocation Under Partially Predictable Demand
From MaRDI portal
Publication:5003724
DOI10.1287/opre.2020.2017zbMath1471.91202arXiv1810.00447OpenAlexW3123344359MaRDI QIDQ5003724
V. H. Manshadi, Patrick Jaillet, Dawsen Hwang
Publication date: 29 July 2021
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1810.00447
Analysis of algorithms (68W40) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Online algorithms; streaming algorithms (68W27)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Robust linear optimization under general norms.
- Who solved the secretary problem
- Robust optimization-methodology and applications
- The Underlying Markov Decision Process in the Single-Leg Airline Yield-Management Problem
- An Analysis of Bid-Price Controls for Network Revenue Management
- Model Predictive Control for Dynamic Resource Allocation
- A Dynamic Near-Optimal Algorithm for Online Linear Programming
- Secretary Problems with Non-Uniform Arrival Order
- 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
- Revenue Management with Limited Demand Information
- Performance of an LP-Based Control for Revenue Management with Unknown Demand Parameters
- AdWords and generalized online matching
- Asymptotic Behavior of an Allocation Policy for Revenue Management
- The Design of Competitive Online Algorithms via a Primal—Dual Approach
- The Secretary Problem and Its Extensions: A Review
- Primal beats dual on online packing LPs in the random-order model
- Airline Seat Allocation with Multiple Nested Fare Classes
- Dynamic Programming and Decision Theory
This page was built for publication: Online Resource Allocation Under Partially Predictable Demand
