Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
Outline
Overview and basic economics Revenue management models & methodology Auctions and alternative price mechanisms Research challenges
Supply Side
Low marginal costs Capacity constraints Lumpy capacity Network effects
Competitive markets
Demand variability
Aggregate variability Individual uncertainty
Pricing
Capacity Allocation
Example
5 customers with different valuations (unobservable) 2 Flights Capacity = 3 seats $800
8:00 AM 1:00 PM
$700 Best single price: $700 Revenue: 2 x $700 = $1400 $800 $700 Maximum obtainable revenue $800 + $700 + $400 + $300 +$ 200 = $2400 58% of maximum achieved
$700
$700 Price discrimination: SA stay: $400 No SA stay: $700 Revenue: 2 x $700 + 1 x $400 = $1800 Maximum revenue $2400
$400
$300 $200
Is sorting discrimination?
$109.58
Load factor
W ed ne sd ay
Th ur sd ay
Sa tu rd ay
Tu es da y
Su nd ay
M on da y
Fr id ay
p1 P ( D 1) = c p 2 P( D 2 ) = c M p n P( D n ) = c
p1 P( D 1) = c
P(D q )
Period 1
Type 1 customers - low valuation - certain need Self-select period 1 discount
Period 2
Type 2 customers - high valuation (given need) - uncertain need Self-select period 2 price
p1 = c
p2 P( Need ) = c
Overbooking
Rothstein (1971, 1974, 1985) Shlifer and Vardi (1975) Liberman & Yechiali (1978) Bitran & Gilbert (1992) Chatwin (1997) Karesman & van Ryzin (1998)
Pricing
10
(L before H)
Fare (net contributi on) of class i f 1 > f 2 > K > f n +1 Nested protection level for class i and higher
aircraft cabin
1 2
3
Optimality conditions:
fi+1 P ( Ai ( X , )) = 0 fi
i = 1, .. . , n
11
Hotel network:
M T
TH
SA
SU
12
Dynamic Program
R j Vt 1 ( x ) Vt 1 ( x A j )
Issues:
displacement cost (opportunity cost)
13
A
t=1
1
Itinerary A,B,C A,B B,C Fare $ 500 $ 250 $ 250
B
Prob. 0.40 0.30 0.30
2
At
t=0
Fare $ 500
10% improvement
14
But bid prices are asymptotically optimal (Talluri & van Ryzin MS 98)
Consider a sequence of problems indexed by Rt ( ) = D R t / x( ) = x k ( ) = k
random revenue/ar rival remaining leg inventory remaining time
D1
D2
D3
Dt
max rt qt
t
r1 r2 r3
rt
q t Dt
q
t
Dual price C
15
Network approximations
Example: Deterministic LP
Vt LP ( x ) = max
r
j
yj
Ay x 0 y EY
R j Vt LP ( x ) Vt LP ( x A j ) TVt LP ( x ) A j =
iA j
16
r
j
E min{ Yj , y j }
Ay x y 0
Example: Randomized LP
(Talluri and van Ryzin 97)
Vt ( x ) = E max
PI
r
j
yj
Ay x : (Y ) 0 y Y
PI
( Y )
i =1 i
17
%Over LP Revenue
1.00%
Load Factor
-1.00%
-2.00%
NLP1
NLP2
RanLP
DP Approx.
18
Research
Basic economic theory Auction design Game theory based models Integration of different mechanisms
Airline-operated auctions
South African Airways, Air Portugal, Cathay Pacific, Virgin
19
Ex: Priceline.com
Approximately how it works
Airlines provide priceline.com with
Itinerary/leg prices Capacity allocations (max. number of seats) Basis: traditional RM calculations
accept
reject
Vt ( x ) = 165
displacement cost RM-based displacement cost becomes the reserve price for the auctioneer.
20
Capacity-controlled discounts currently provide significant price flexibility Demand is spread over time, so organizing single auction event seems impractical Industry scepticism and resistance
"We have mixed views on seats as a commodity." "There's the potential to lose control of inventory, and we're not anxious to push that along."
Steve Cossette
VP Distribution Planning Continental Airlines IATA Press Briefing
21
22
Ex: Flight 1 Flight 2 Utility (avg.) Low High Price High Low
What happens if we ignore choice behavior? Sample path gradient algorithm for standard inventory models (e.g newsboy/Littlewood).
23
24
#competing flights
25
120 100 80 60 40 20 0
10 #competing flights
20
Theory questions
How does it help? Whom does it help? Incentives to join? Incentives to invest?
26