Title
On the Minimax Complexity of Pricing in a Changing Environment
Abstract
We consider a pricing problem in an environment where the customers' willingness-to-pay (WtP) distribution may change at some point over the selling horizon. Customers arrive sequentially and make purchase decisions based on a quoted price and their private reservation price. The seller knows the WtP distribution pre-and postchange but does not know the time at which this change occurs. The performance of a pricing policy is measured in terms of regret: the loss in revenues relative to an oracle that knows the time of change prior to the start of the selling season. We derive lower bounds on the worst-case regret and develop pricing strategies that achieve the order of these bounds, thus establishing the complexity of the pricing problem. Our results shed light on the role of price experimentation and its necessity for optimal detection of changes in market response/WtP. Our formulation allows for essentially arbitrary consumer WtP distributions and purchase request patterns.
Year
DOI
Venue
2011
10.1287/opre.1100.0867
Operations Research
Keywords
Field
DocType
selling horizon,wtp distribution pre-and postchange,purchase request pattern,estimation,arbitrary consumer wtp distribution,purchase decision,price experimentation,pricing,detection,minimax complexity,change-point,pricing problem,non-stationary demand,private reservation price,price experi- mentation,pricing policy,pricing strategy,seasonality,lower bound
Revenue,Economics,Minimax,Reservation price,Regret,Upper and lower bounds,Oracle,Pricing strategies,Market research,Operations management
Journal
Volume
Issue
ISSN
59
1
0030-364X
Citations 
PageRank 
References 
18
1.09
4
Authors
2
Name
Order
Citations
PageRank
Omar Besbes130517.53
Assaf Zeevi275052.23