A Dynamic near-optimal algorithm for online linear programming

Operations Research

Volumn 62, Issue 4, 2014, Pages 876-890

  Agrawal, Shipra ^a   Wang, Zizhuo ^b   Ye, Yinyu ^c  

^a MICROSOFT RESEARCH   (United States)

^b University of Minnesota   (United States)

^c Stanford University   (United States)

Author keywords

Dynamic price update; Linear programming; Online algorithms; Primal dual

Indexed keywords

COSTS; LINEAR PROGRAMMING; OPTIMIZATION;

DYNAMIC PRICE; LEARNING-BASED ALGORITHMS; NEAR-OPTIMAL ALGORITHMS; OBJECTIVE FUNCTIONS; ON-LINE ALGORITHMS; OPTIMIZATION MODELING; PRIMAL-DUAL; SEQUENTIAL DECISIONS;

LEARNING ALGORITHMS;

EID: 84918518581     PISSN: 0030364X     EISSN: 15265463     Source Type: Journal    
DOI: 10.1287/opre.2014.1289     Document Type: Article

References (32)

1. Awerbuch B, Azar Y, Plotkin S (1993) Throughput-competitive on-line routing. FOCS'93: Proc. 34th Annual IEEE Sympos. Foundations Comput. Sci. (IEEE Computer Society, Washington, DC), 32-40.
2. Babaioff M, Immorlica N, Kempe D, Kleinberg R (2007) A knapsack secretary problem with applications. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, Lecture Notes in Computer Science, Vol. 4627 (Springer-Verlag, Berlin, Heidelberg), 16-28.
3. Babaioff M, Immorlica N, Kempe D, Kleinberg R (2008) Online auctions and generalized secretary problems. SIGecom Exch. 7(2):1-11.
4. Bahmani B, Kapralov M (2010) Improved bounds for online stochastic matching. ESA'10: Proc. 18th Annual Eur. Conf. Algorithms: Part I (Springer-Verlag, Berlin, Heidelberg), 170-181.
5. Bitran G, Caldentey R (2003) An overview of pricing models for revenue management. Manufacturing Service Oper. Management 5(3):203-229.
6. Borodin A, El-Yaniv R (1998) Online Computation and Competitive Analysis (Cambridge University Press, New York).
7. Buchbinder N, Naor J (2009a) The design of competitive online algorihms via a primal-dual approch. Foundations and Trends Theoret. Comput. Sci. 3(2-3):93-263.
8. Buchbinder N, Naor J (2009b) Online primal-dual algorithms for covering and packing. Math. Oper. Res. 34(2):270-286.
9. Cesa-Bianchi N, Lugosi G (2006) Prediction, Learning, and Games (Cambridge University Press, New York).
10. Cooper WL (2002) Asymptotic behavior of an allocation policy for revenue management. Oper. Res. 50(4):720-727.
11. Dantzig G (1963) Linear Programming and Extensions (Princeton University Press, Princeton, NJ).
12. Devanur N (2011) Online algorithms with stochastic input. SIGecom Exch. 10(2):40-49.
13. Devanur N, Hayes T (2009) The adwords problem: Online keyword matching with budgeted bidders under random permutations. EC'09: Proc. 10th ACM Conf. Electronic Commerce (ACM, New York), 71-78.
14. Devanur N, Jain K, Sivan B, Wilkens C (2011) Near optimal online algorithms and fast approximation algorithms for resource allocation problems. EC'11: Proc. 12th ACM Conf. Electronic Commerce (ACM, New York) 29-38.
15. Elmaghraby W, Keskinocak P (2003) Dynamic pricing in the presence of inventory considerations: Research overview, current practices and future directions. Management Sci. 49(10):1287-1389.
16. Feldman J, Mehta A, Mirrokni V, Muthukrishnan S (2009a) Online stochastic matching: Beating 11=e. FOCS'09: Proc. 50th Annual IEEE Sympos. Foundations Comput. Sci. (IEEE Computer Society, Washington, DC), 117-126.
17. Feldman J, Henzinger M, Korula N, Mirrokni V, Stein C (2010) Online stochastic packing applied to display ad allocation. Algorithms-ESA 2010 (Springer-Verlag, Berlin, Heidelberg), 182-194.
18. Feldman J, Korula N, Mirrokni V, Muthukrishnan S, Pal M (2009b) Online ad assignment with free disposal. WINE'09: Proc. 5th Workshop on Internet and Network Econom. (Springer-Verlag, Berlin, Heidelberg), 374-385.
19. Gallego G, van Ryzin G (1994) Optimal dynamic pricing of inventories with stochastic demand over finite horizons. Management Sci. 40(8): 999-1020.
20. Gallego G, van Ryzin G (1997) A multiproduct dynamic pricing problem and its application to network yield management. Oper. Res. 45(1):24-41.
21. Goel G, Mehta A (2008) Online budgeted matching in random input models with applications to adwords. SODA'08: Proc. 19th Annual ACM-SIAM Sympos. Discrete Algorithms (SIAM, Philadelphia), 982-991.
22. Karande C, Mehta A, Tripathi P (2011) Online bipartite matching with unknown distributions. STOC'11: Proc. 43rd Annual ACM Sympos. Theory Comput. (ACM, New York), 587-596.
23. Kleinberg R (2005) A multiple-choice secretary algorithm with applications to online auctions. SODA'05: Proc. 16th Annual ACM-SIAM Sympos. Discrete Algorithms (SIAM, Philadelphia), 630-631.
24. Mahdian M, Yan Q (2011) Online bipartite matching with random arrivals: An approach based on strongly factor-revealing LPs. STOC'11: Proc. 43rd Annual ACM Sympos. Theory Comput. (ACM, New York), 597-606.
25. Mehta A, Saberi A, Vazirani U, Vazirani V (2005) Adwords and generalized on-line matching. FOCS'05: Proc. 46th Annual IEEE Sympos. Foundations Comput. Sci. (IEEE Computer Society, Washington, DC), 264-273.
26. Molinaro M, Ravi R (2014) Geometry of online packing linear programs. Math. Oper. Res. 39(1):46-59.
27. Orlik P, Terao H (1992) Arrangement of Hyperplanes. Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences] (Springer-Verlag, Berlin).
28. Simpson RW (1989) Using network flow techniques to find shadow prices for market and seat inventory control. MIT Flight Transportation Laboratory Memorandum M89-1, Cambridge, MA.
29. Talluri K, van Ryzin G (1998) An analysis of bid-price controls for network revenue management. Management Sci. 44(11):1577-1593.
30. van der Vaart A, Wellner J (1996) Weak Convergence and Empirical Processes: With Applications to Statistics. Springer Series in Statistics (Springer, New York).
31. Wang Z (2012) Dynamic learning mechanism in revenue management problems. Unpublished doctoral thesis, Stanford University, Palo Alto, CA.
32. Williamson EL (1992) Airline network seat control. Unpublished doctoral thesis, MIT, Cambridge, MA.