2011
DOI: 10.1287/msom.1100.0316
|View full text |Cite
|
Sign up to set email alerts
|

Regret in Overbooking and Fare-Class Allocation for Single Leg

Abstract: Focusing on a seller's regret in not acting optimally, we develop a model of overbooking and fare-class allocation in the multifare, single-resource problem in revenue management. We derive optimal static overbooking levels and booking limits, in closed form, that minimize the maximum relative regret (i.e., maximize competitive ratio). We prove that the optimal booking limits are nested. Our work addresses a number of important issues. (i) We use partial information, which is critical because of the difficulty… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
17
0

Year Published

2013
2013
2022
2022

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 34 publications
(17 citation statements)
references
References 28 publications
0
17
0
Order By: Relevance
“…For example, Lim and Shanthikumar (2007) consider dynamic pricing problems in which the decision maker knows only that the true model is within some specified distance, as measured by relative entropy, from a nominal model. Lan et al (2011) consider overbooking and allocation decisions with limited information using ideas from competitive analysis of algorithms, and focus on obtaining policies that yield the best worst-case performance. The paper also provides many additional references.…”
Section: Literature Reviewmentioning
confidence: 99%
“…For example, Lim and Shanthikumar (2007) consider dynamic pricing problems in which the decision maker knows only that the true model is within some specified distance, as measured by relative entropy, from a nominal model. Lan et al (2011) consider overbooking and allocation decisions with limited information using ideas from competitive analysis of algorithms, and focus on obtaining policies that yield the best worst-case performance. The paper also provides many additional references.…”
Section: Literature Reviewmentioning
confidence: 99%
“…They show that these two models can be analyzed in a unified manner and both models provide nested booking limits. In a related work, Lan et al (2011) formulate a joint overbooking and seat allocation model, where both the random demand and no-shows are characterized using interval uncertainty. They focus on the seller's regret in not being able to find the optimal policy due to the lack of information.…”
Section: Literature Reviewmentioning
confidence: 99%
“…In particular, we conduct simulation experiments to benchmark the policies obtained with our lower bounding model (P LB I ), upper bounding model (P UB I ) and the dynamic model (P DM ) against some well-known approaches used in the literature (Lan et al, 2008(Lan et al, , 2011. We next explain our simulation setup in detail and then present our numerical results.…”
Section: Computational Experimentsmentioning
confidence: 99%
“…Luo et al (2009) formulate a static overbooking model with fixed weight and volume capacity for the air cargo business. Lan et al (2011) and Aydın et al (2013) address combined overbooking and capacity allocation problem for multiple booking classes for a single-leg flight, while Mookherjee and Friesz (2008) propose an integrated approach to overbooking, capacity allocation, and pricing for an oligopoly of service providers.…”
Section: Introductionmentioning
confidence: 99%