Near optimal online algorithms and fast approximation algorithms for resource allocation problems

Proceedings of the ACM Conference on Electronic Commerce

Volumn , Issue , 2011, Pages 29-38

  Devanur, Nikhil R ^a   Jain, Kamal ^a   Sivan, Balasubramanian ^b   Wilkens, Christopher A ^c  

^a MICROSOFT RESEARCH   (United States)

^b University of Wisconsin Madison   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

online algorithms; packing covering; stochastic input

Indexed keywords

COMPETITIVE RATIO; DISTRIBUTIONAL MODELS; FAST ALGORITHMS; GREEDY ALGORITHMS; MATRIX; OFFLINE; ON-LINE ALGORITHMS; ON-LINE SETTING; PACKING-COVERING; RANDOMIZED ALGORITHMS; RESOURCE ALLOCATION PROBLEM; STOCHASTIC INPUT; STOCHASTIC INPUTS; UPPER BOUND;

BUDGET CONTROL; ELECTRONIC COMMERCE; OPTIMIZATION; PROFITABILITY; RESOURCE ALLOCATION; STOCHASTIC MODELS; STOCHASTIC SYSTEMS;

APPROXIMATION ALGORITHMS;

EID: 79959593176     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1993574.1993581     Document Type: Conference Paper

References (21)

1. Sanjeev Arora, Elad Hazan, and Satyen Kale. The multiplicative weights update method: a meta algorithm and applications. Technical report, 2005.
2. Zoe Abrams, Ofer Mendelevitch, and John Tomlin. Optimal delivery of sponsored search advertisements subject to budget constraints. In EC '07: Proceedings of the 8th ACM conference on Electronic commerce, pages 272-278, New York, NY, USA, 2007. ACM.
3. Shipra Agrawal, Zizhuo Wang, and Yinyu Ye. A dynamic near-optimal algorithm for online linear programming. arXiv:0911.2974v1, 2009.
4. Niv Buchbinder, Kamal Jain, and Joseph Seffi Naor. Online primal-dual algorithms for maximizing ad-auctions revenue. In ESA'07: Proceedings of the 15th annual European conference on Algorithms, pages 253-264, Berlin, Heidelberg, 2007. Springer-Verlag.
5. Bahman Bahmani and Michael Kapralov. Improved bounds for online stochastic matching. In ESA, pages 170-181, 2010.
6. Denis Charles, Max Chickering, Nikhil R. Devanur, Kamal Jain, and Manan Sanghi. Fast algorithms for finding matchings in lopsided bipartite graphs with applications to display ads. In EC '10: Proceedings of the 11th ACM conference on Electronic commerce, pages 121-128, New York, NY, USA, 2010. ACM.
7. Tanmoy Chakraborty, Eyal Even-Dar, Sudipto Guha, Yishay Mansour, and S. Muthukrishnan. Selective call out and real time bidding. In To appear in WINE, 2011.
8. Nikhil R. Devanur and Thomas P. Hayes. The adwords problem: online keyword matching with budgeted bidders under random permutations. In John Chuang, Lance Fortnow, and Pearl Pu, editors, ACM Conference on Electronic Commerce, pages 71-78. ACM, 2009.
9. Jon Feldman, Monika Henzinger, Nitish Korula, Vahab S. Mirrokni, and Clifford Stein. Online stochastic packing applied to display ad allocation. In ESA, pages 182-194, 2010.
10. Lisa K. Fleischer. Approximating fractional multicommodity flow independent of the number of commodities. SIAM J. Discret. Math., 13(4):505-520, 2000.
11. Jon Feldman, Aranyak Mehta, Vahab Mirrokni, and S. Muthukrishnan. Online stochastic matching: Beating 1-1/e. In FOCS '09: Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science, pages 117-126, Washington, DC, USA, 2009. IEEE Computer Society.
12. Naveen Garg and Jochen Koenemann. Faster and simpler algorithms for multicommodity flow and other fractional packing problems. In FOCS '98: Proceedings of the 39th Annual Symposium on Foundations of Computer Science, page 300, Washington, DC, USA, 1998. IEEE Computer Society.
13. Gagan Goel and Aranyak Mehta. Online budgeted matching in random input models with applications to adwords. In SODA '08: Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms, pages 982-991, Philadelphia, PA, USA, 2008. Society for Industrial and Applied Mathematics.
14. Bala Kalyanasundaram and Kirk R. Pruhs. An optimal deterministic algorithm for online b-matching. Theor. Comput. Sci., 233(1-2):319-325, 2000.
15. Anil Kamath, Omri Palmon, and Serge Plotkin. Routing and admission control in general topology networks with poisson arrivals. In SODA '96: Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms, pages 269-278, Philadelphia, PA, USA, 1996. Society for Industrial and Applied Mathematics.
16. Vahideh Manshadi, Shayan Gharan, and Amin Saberi. Online stochastic matching: Online actions based on offline statistics. In To appear in SODA, 2011.
17. Rajeev Motwani, Rina Panigrahy, and Ying Xu 0002. Fractional matching via balls-and-bins. In APPROX-RANDOM, pages 487-498, 2006.
18. Aranyak Mehta, Amin Saberi, Umesh Vazirani, and Vijay Vazirani. Adwords and generalized on-line matching. In In FOCS '05: Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science, pages 264-273. IEEE Computer Society, 2005.
19. Serge A. Plotkin, David B. Shmoys, and Éva Tardos. Fast approximation algorithms for fractional packing and covering problems. In FOCS '91: Proceedings of the 32nd annual symposium on Foundations of computer science, pages 495-504, Washington, DC, USA, 1991. IEEE Computer Society.
20. Erik Vee, Sergei Vassilvitskii, and Jayavel Shanmugasundaram. Optimal online assignment with forecasts. In EC '10: Proceedings of the 11th ACM conference on Electronic commerce, pages 109-118, New York, NY, USA, 2010. ACM.
21. Neal E. Young. Randomized rounding without solving the linear program. In SODA '95: Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms, pages 170-178, Philadelphia, PA, USA, 1995. Society for Industrial and Applied Mathematics.