Stochastic Systems

On bid-price controls for network revenue management

Barış Ata and Mustafa Akan

Full-text: Open access

Abstract

We consider a network revenue management problem and advance its dual formulation. The dual formulation reveals that the (optimal) shadow price of capacity forms a nonnegative martingale. This result is proved under minimal assumptions on network topology and stochastic nature of demand, allowing an arbitrary statistical dependence structure across time and products. Next, we consider a quadratic perturbation of the network revenue management problem and show that a simple (perturbed) bid-price control is optimal for the perturbed problem; and it is $\varepsilon$-optimal for the original network revenue management problem. Finally, we consider a predictable version of this control, where the bid prices used in the current period are last updated in the previous period, and provide an upper bound on its optimality gap in terms of the (quadratic) variation of demand. Using this upper bound we show that there exists a near-optimal such control in the usual case when periods are small compared to the planning horizon provided that either demand or the incremental information arriving during each period is small. We establish the martingale property of the (near) optimal bid prices in both settings. The martingale property can have important implications in practice as it may offer a tool for monitoring the revenue management systems.

Article information

Source
Stoch. Syst., Volume 5, Number 2 (2015), 268-323.

Dates
Received: July 2012
First available in Project Euclid: 23 December 2015

Permanent link to this document
https://projecteuclid.org/euclid.ssy/1450879456

Digital Object Identifier
doi:10.1214/12-SSY081

Mathematical Reviews number (MathSciNet)
MR3442429

Zentralblatt MATH identifier
1358.90053

Citation

Ata, Barış; Akan, Mustafa. On bid-price controls for network revenue management. Stoch. Syst. 5 (2015), no. 2, 268--323. doi:10.1214/12-SSY081. https://projecteuclid.org/euclid.ssy/1450879456


Export citation

References

  • Adelman, D. (2007). Dynamic bid prices in revenue management. Operations Research 56, 647–661.
  • Adelman, D. and Mersereau, A. (2008). Relaxations of weakly coupled stochastic dynamic programs. Operations Research 56(3), 712–727.
  • Akan, M. and Ata, B. (2009). Bid-price controls for continuous time network revenue management: Martingale characterization of optimal bid prices. Mathematics of Operations Research 34(4), 912–936.
  • Bertsimas, D. and Popescu, I. (2003). Revenue management in a dynamic network environment. Tran. Sci. 37, 257–277.
  • Bertsimas, D. and Tsitsiklis, J. (1997). Introduction to Linear Optimization. Belmont, MA: Athena Scientific.
  • Huang, C. (1985). Information structure and equilibrium asset prices. Journal of Economic Theory 34, 33–71.
  • Jasin, S. and Kumar, S. (2012). A re-solving heuristic with bounded revenue loss for network revenue management with customer choice. Mathematics of Operations Research 37(2), 313–345.
  • Jasin, S. and Kumar S. (2013). Analysis of deterministic lp-based booking limit and bid price controls for revenue management. Operations Research 61(6), 1312–1320.
  • Karatzas, I. and Shreve, S. (1991). Brownian Motion and Stochastic Calculus ($2^{nd}$ ed.). Springer, New York.
  • Kleywegt, A. (2001). An optimal control problem of dynamic pricing. Unpublished Manuscript available at http://www2.isye.gatech.edu/~anton/OptControl.pdf.
  • Kunnumkal, S. and Topaloglu, H. (2010). Computing time-dependent bid-prices in network revenue management problems. Transportation Science 44(1), 38–62.
  • Reiman, M. and Wang, Q. (2008). An asymptotically optimal policy for a quantity-based network revenue management problem. Mathematics of Operations Research 33(2), 257–282.
  • Rockafellar, R. and Wets, R.-B. (1997). Variational Analysis, Grundlehren der Mathematischen Wissenschaften 317. Springer.
  • Schrag, M. (2009). Evaluating revenue management. The Practice of Revenue Management Keynote Seminar at the $9^{th}$ Annual INFORMS Revenue Management and Pricing Section Conference, Evanston, IL.
  • Simpson, R. (1989). Using network flow techniques to find shadow prices for market and seat inventory control. MIT Flight Transportation Laboratory Memorandum.
  • Talluri, K. and van Ryzin, G. (2004). The Theory and Practice of Revenue Management. Kluwer Academic Publishers, Norwell, MA.
  • Talluri, T. and van Ryzin, G. (1998). An analysis of bid-price controls for network revenue management. Management Science 44, 1577–1593.
  • Topaloglu, H. (2008). A stochastic approximation method to compute bid prices in network revenue management problems. INFORMS Journal on Computing 20(4), 596–610.
  • Topaloglu, H. (2009). Using lagrangian relaxation to compute capacity-dependent bid prices in network revenue management. Operations Research 57(3), 637–649.
  • Williams, D. (1991). Probability with Martingales. Cambridge University Press.
  • Williamson, E. (1992). Airline Network Seat Control. Ph. D. thesis, MIT.