Online stochastic matching: Beating 1-1/e

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2009, Pages 117-126

  Feldman, Jon ^a   Mehta, Aranyak ^a   Mirrokni, Vahab ^a   Muthukrishnan, S ^a  

^a GOOGLE INC   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION RATIOS; BIPARTITE MATCHING PROBLEMS; BIPARTITE MATCHINGS; FLOW GRAPH; GREEDY ALGORITHMS; LOAD-BALANCING; MATCHINGS; MAX-FLOW PROBLEM; MAXIMUM FLOWS; NOVEL APPLICATIONS; OFFLINE; ON-LINE ALGORITHMS; ONLINE DECISION-MAKING; ONLINE PROBLEMS; POWER-OF-TWO; PREFERENCE ORDER; STOCHASTIC MATCHING; UPPER BOUND;

COMPUTER SCIENCE; FIBER OPTIC CHEMICAL SENSORS; STOCHASTIC SYSTEMS;

APPROXIMATION ALGORITHMS;

EID: 77952348885     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2009.72     Document Type: Conference Paper

References (20)

1. S. Alaei and A. Malekian, "Maximizing sequence-submodular functions, manuscript," 2009.
2. Y. Azar, B. Birnbaum, A. Karlin, C. Mathieu, and C. Nguyen, "Improved Approximation Algorithms for Budgeted Allocations," in Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I. Springer Verlag Berlin, Heidelberg, 2008, pp. 186-197.
3. Y. Azar, A. Z. Broder, A. R. Karlin, and E. Upfal, "Balanced allocations," SIAM J. Comput., vol. 29, no. 1, pp. 180-200, 1999.
4. D. Bertsekas, Dynamic programming and optimal control, 2007.
5. D. P. Bertsekas and D. A. Castanon, "Rollout algorithms for stochastic scheduling problems," Journal of Heuristics, vol. 5, no. 1, pp. 89-108, 1999.
6. B. Birnbaum and C. Mathieu, "On-line bipartite matching made simple," 2008.
7. N. Buchbinder, K. Jain, and J. Naor, "Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue," in Algorithms-ESA 2007 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007: Proceedings. Springer, 2007, p. 253.
8. D. Chakrabarty and G. Goel, "On the approximability of budgeted allocations and improved lower bounds for submodular welfare maximization and GAP," in Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science-Volume 00. IEEE Computer Society Washington, DC, USA, 2008, pp. 687-696.
9. D. P. de Farias and B. V. Roy, "On constraint sampling in the linear programming approach to approximate dynamic programming," Math. Oper. Res., vol. 29, no. 3, pp. 462-478, 2004.
10. N. Devanur and T. Hayes, "The adwords problem: Online keyword matching with budgeted bidders under random permutations," in ACM Conference on Electronic Commerce, 2009.
11. V. F. Farias and B. V. Roy, "Approximation algorithms for dynamic resource allocation," Oper. Res. Lett., vol. 34, no. 2, pp. 180-190, 2006.
12. N. Garg, A. Gupta, S. Leonardi, and P. Sankowski, "Stochastic analyses for online combinatorial optimization problems," in SODA, 2008, pp. 942-951.
13. G. Goel and A. Mehta, "Online budgeted matching in random input models with applications to adwords," in SODA, 2008, pp. 982-991.
14. F. Grandoni, A. Gupta, S. Leonardi, P. Miettinen, P. Sankowski, and M. Singh, "Set covering with our eyes closed," in FOCS, 2008, pp. 347-356.
15. R. Karp, U. Vazirani, and V. Vazirani, "An optimal algorithm for online bipartite matching," in Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990.
16. M. Mahdian, H. Nazerzadeh, and A. Saberi, "Allocating online advertisement space with unreliable estimates," in ACM Conference on Electronic Commerce, 2007, pp. 288-294.
17. A. Mehta, A. Saberi, U. Vazirani, and V. Vazirani, "Adwords and generalized online matching," in FOCS, 2005.
18. M. Mitzenmacher, "The power of two choices in randomized load balancing," IEEE Trans. Parallel Distrib. Syst., vol. 12, no. 10, pp. 1094-1104, 2001.
19. A. Shrijver, Combinatorial Optimization-Polyhedra and Efficiency, 2003.
20. A. Srinivasan, "Budgeted Allocations in the Full-Information Setting," in Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques: 11th International Workshop, Approx 2008 and 12th International Workshop, Random 2008, Boston, Ma, USA, August 25-27, 2008. Springer, 2008, p. 247.