AdWords and generalized on-line matching

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

Volumn 2005, Issue , 2005, Pages 264-273

  Mehta, Aranyak ^a   Saberi, Amin ^a   Vazirani, Umesh ^a   Vazirani, Vijay ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

LINEAR PROGRAMMING; OPTIMAL SYSTEMS; OPTIMIZATION; PATTERN MATCHING; PROBLEM SOLVING; QUERY LANGUAGES; SEARCH ENGINES;

BIPARTITE MATCHING PROBLEMS; ONLINE MATCHING; OPTIMAL ALGORITHMS;

ONLINE SYSTEMS;

EID: 33748591085     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SFCS.2005.12     Document Type: Conference Paper

References (17)

1. N. Andelman and Y. Mansour. Auctions with budget constraints. In 9th Scandinavian Workshop on Algorithm Theory (SWAT), pages 26-38, 2004.
2. Y. Azar and A. Litichevskey. Maximizing throughput in multi-queue switches. ESA, 2004.
3. V. Bahl, M. Hajiaghayi, K. Jain, V. Mirrokni, L. Qiu, and A. Saberi. Cell breathing in wireless lan: algorithms and evaluation. Manuscript, 2004.
4. N. Bansal, L. Fleischer, T. Kimbrel, M. Mahdian, B. Schieber, and M. Sviridenko. Further improvements in competitive guarantees for QoS buffering. In ICALP, volume 3142 of LNCS, pages 196-207. Springer, 2004.
5. C. Borgs, J. Chayes, N. Immorlica, M. Mahdian, and A. Saberi. Multi-unit auctions with budget-constrained bidders. In ACM conference on Electronic Commerce, 2005.
6. Y. Freund and R. Schapire. Game theory, on-line prediction and boosting. COLT, 1996.
7. M. Goemans and J. Kleinberg. An improved approximation algorithm for the minimum latency problem. Mathematical Programming, 82:111-124, 1998.
8. M. Henzinger. Private communication. 2004.
9. K. Jain, M. Mahdian, E. Markakis, A. Saberi, and V. Vazirani. Greedy facility location algorithms analyzed using dual fitting with factor-revealing lp. J. ACM, 2003.
10. K. Jain, M. Mahdian, and A. Saberi. A new greedy approach for facility location problems. In STOC, pages 731-740, 2002.
11. B. Kalyanasundaram and K. Pruhs. On-line network optimization problems. In Developments from a June 1996 seminar on Online algorithms, pages 268-280. Springer-Verlag, 1998.
12. B. Kalyanasundaram and K. R. Pruhs. An optimal deterministic algorithm for online b -matching. Theoretical Computer Science, 233(1-2):319-325, 2000.
13. 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.
14. B. Lehman, D. Lehman, and N. Nisan. Combinatorial auctions with decreasing marginal utilities. In Proceedings of the 3rd ACM conference on Electronic Commerce, pages 18-28, 2001.
15. M. Mahdian, E. Markakis, A. Saberi, and V. Vazirani. A greedy facility location algorithm analyzed using dual fitting. RANDOM-APPROX, pages 127-137, 2001.
16. R. McEliese, E. Rodemich, H. R. Jr., and L. Welch. New upper bounds on the rate of a code via the delsarte-macwilliams inequalities. IEEE Trans. Inform. Theory, pages 157-166, 1977.
17. A. C. Yao. Probabilistic computations: towards a unified measure of complexity. FOCS, pages 222-227, 1977.