Toward Robust Revenue Management: Competitive Analysis of Online Booking
In this paper, we consider the revenue management problem from the perspective of online algorithms. This approach eliminates the need for both demand forecasts and a risk-neutrality assumption. The competitive ratio of a policy relative to a given input sequence is the ratio of the policy's pe...
Saved in:
| Published in: | Operations research Vol. 57; no. 4; pp. 950 - 963 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Hanover, MD
INFORMS
01.07.2009
Institute for Operations Research and the Management Sciences |
| Subjects: | |
| ISSN: | 0030-364X, 1526-5463 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | In this paper, we consider the revenue management problem from the perspective of online algorithms. This approach eliminates the need for both demand forecasts and a risk-neutrality assumption. The competitive ratio of a policy relative to a given input sequence is the ratio of the policy's performance to the offline optimal. Under the online algorithm approach, revenue management policies are evaluated based on the highest competitive ratio they can guarantee. We are able to define lower bounds on the best-possible performance and describe policies that achieve these lower bounds. We address the two-fare problem in greatest detail, but also treat the general multifare problem and the bid-price control problem. |
|---|---|
| Bibliography: | SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 |
| ISSN: | 0030-364X 1526-5463 |
| DOI: | 10.1287/opre.1080.0654 |