Simultaneous approximations for adversarial and stochastic online budgeted allocation

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2012, Pages 1690-1701

  Mirrokni, Vahab S ^a   Gharan, Shayan Oveis ^b   Zadimoghaddam, Morteza ^c  

^a GOOGLE INC   (United States)

^b Stanford University   (United States)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BUDGET CONTROL; GRAPH THEORY; GRAPHIC METHODS; STOCHASTIC SYSTEMS;

ALLOCATION PROBLEMS; APPROXIMATION FACTOR; APPROXIMATION RATIOS; ON-LINE ALGORITHMS; OPTIMAL COMPETITIVE RATIOS; RANDOM PERMUTATION MODELS; RANDOM PERMUTATIONS; SIMULTANEOUS APPROXIMATION;

APPROXIMATION ALGORITHMS;

EID: 84860112401     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973099.134     Document Type: Conference Paper

References (27)

1. S. Agrawal, Z. Wang, and Y. Ye. A dynamic near-optimal algorithm for online linear programming. CoRR, 2009.
2. D. Applegate and E. Cohen. Making routing robust to changing traffic demands: algorithms and evaluation. IEEE/ACM Trans. Netw., 16(6):1193-1206, 2006. (Pubitemid 46432426)
3. Y. Azar, E. Cohen, A. Fiat, H. Kaplan, and H. Räcke. Optimal oblivious routing in polynomial time. J. Comput. Syst. Sci., 69(3):383-394, 2004.
4. B. Bahmani and M. Kapralov. Improved bounds for online stochastic matching. In ESA, 2010.
5. A. Ben-Tal and A. Nemirovski. Robust optimization - methodology and applications. Math. Program., 92(3):453-480, 2002. (Pubitemid 44744762)
6. D. Bertsimas, D. Pachamanova, and M. Sim. Robust linear optimization under general norms. Oper. Res. Lett., 32(6):510-516, 2004.
7. B. Birnbaum and C. Mathieu. On-line bipartite matching made simple. SIGACT News, 39:80-87, 2008.
8. N. Buchbinder, K. Jain, and J. Naor. Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue. In ESA, page 253. Springer, 2007.
9. N. Devanur and T. Hayes. The adwords problem: Online keyword matching with budgeted bidders under random permutations. In EC, 2009.
10. N. R. Devanur, K. Jain, B. Sivan, and C. A. Wilkens. Near optimal online algorithms and fast approximation algorithms for resource allocation problems. In EC, pages 29-38, 2011.
11. J. Feldman, M. Henzinger, N. Korula, V. S. Mirrokni, and C. Stein. Online stochastic packing applied to display ad allocation. In Proceedings of the 18th annual European conference on Algorithms: Part I, ESA'10, pages 182-194, Berlin, Heidelberg, 2010. Springer-Verlag.
12. J. Feldman, N. Korula, V. Mirrokni, S. Muthukrishnan, and M. Pal. Online ad assignment with free disposal. In WINE, 2009.
13. J. Feldman, A. Mehta, V. Mirrokni, and S. Muthukrishnan. Online stochastic matching: Beating 1 - 1/e. In FOCS, 2009.
14. B. Haeupler, V. Mirrokni, and M. ZadiMoghaddam. Online stochastic weighted matching: Improved approximation algorithms. In WINE, 2011.
15. P. Jaillet and X. Lu. Online stochastic matching: New algorithms with better bounds. 2011.
16. B. Kalyanasundaram and K. Pruhs. On-line network optimization problems. In Developments from a June 1996 seminar on Online algorithms: the state of the art, pages 268-280, London, UK, 1998. Springer-Verlag.
17. C. Karande, A. Mehta, and P. Tripathi. Online bipartite matching with unknown distributions. In STOC, 2011.
18. R. Karp, U. Vazirani, and V. Vazirani. An optimal algorithm for online bipartite matching. In STOC, 1990.
19. M. Mahdian, H. Nazerzadeh, and A. Saberi. Allocating online advertisement space with unreliable estimates. In EC, pages 288-294, 2007.
20. M. Mahdian and Q. Yan. Online bipartite matching with random arrivals: A strongly factor revealing lp approach. In STOC, 2011.
21. A. Mehta, A. Saberi, U. Vazirani, and V. Vazirani. Adwords and generalized online matching. J. ACM, 54(5):22, 2007.
22. V. H. Menshadi, S. Oveis Gharan, and A. Saberi. Online stochastic matching: Online actions based on offline statistics. In SODA, 2011.
23. R. Motwani, R. Panigrahy, and Y. Xu. Fractional matching via balls-and-bins. In APPROX-RANDOM, 2006.
24. A. Panconesi and A. Srinivasan. Randomized distributed edge coloring via an extension of the chernoff-hoeffding bounds. Siam Journal on Computing, 26:350-368, 1997. (Pubitemid 127652069)
25. B. Tan and R. Srikant. Online advertisement, optimization and stochastic networks. CoRR, 2010.
26. E. Vee, S. Vassilvitskii, and J. Shanmugasundaram. Optimal online assignment with forecasts. In EC, 2010.
27. H. Wang, H. X. 0002, L. Qiu, Y. R. Yang, Y. Zhang, and A. G. Greenberg. Cope: traffic engineering in dynamic networks. In SIGCOMM, pages 99-110, 2006.