Name
Abstract | ||
|---|---|---|
We consider the pricing problem faced by a monopolist who sells a product to a population of consumers over a finite time horizon. Customers are heterogeneous along two dimensions: (i) willingness-to-pay for the product and (ii) arrival time during the selling season. We assume that the seller knows only the support of the customersu0027 valuations and do not make any other distributional assumptions about customersu0027 willingness-to-pay or arrival times. We consider a robust formulation of the selleru0027s pricing problem which is based on the minimization of her worst-case regret, a framework first proposed by Bergemann and Schlag (2008) in the context of static pricing. We consider two distinct cases of customersu0027 purchasing behavior: myopic and strategic customers. For both of these cases, we characterize optimal price paths. For myopic customers, the regret is determined by the price at a critical time. Depending on the problem parameters, this critical time will be either the end of the selling season or it will be a time that equalizes the worst-case regret generated by undercharging customers and the worst-case regret generated by customers waiting for the price to fall. The optimal pricing strategy is not unique except at the critical time. For strategic consumers, we develop a robust mechanism design approach to compute an optimal policy. Depending on the problem parameters, the optimal policy might lead some consumers to wait until the end of the selling season and might price others out of the market. Under strategic customers, the optimal price equalizes the regrets generated by different customer types that arrive at the beginning of the selling season. We show that a seller that does not know if the customers are myopic should price as if they are strategic. We also show there is no benefit under myopic consumers to having a selling season longer than a certain uniform bound, but that the same is not true with strategic consumers.u0000 |
Year | DOI | Venue |
|---|---|---|
2017 | 10.2139/ssrn.2357083 | Operations Research |
Keywords | DocType | Volume |
robust optimization | Journal | 65 |
Issue | Citations | PageRank |
1 | 0 | 0.34 |
References | Authors | |
0 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| René Caldentey | 1 | 157 | 14.93 |
| ying liu | 2 | 0 | 0.68 |
| Ilan Lobel | 3 | 240 | 17.78 |