Balanced allocation with succinct representation

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2010, Pages 523-531

  Alaei, Saeed ^a   Kumar, Ravi ^b   Malekian, Azarakhsh ^a   Vee, Erik ^b  

^a Institute of Advanced Computer Science   (United States)

^b YAHOO RESEARCH   (United States)

Author keywords

Balanced allocation; Convex flow; Maximum flow

Indexed keywords

AMOUNT OF INFORMATION; BALANCED ALLOCATION; COMBINATORIAL ALGORITHM; COMPUTATIONAL ADVERTISINGS; CONSTANT TIME; CONVEX COST; CONVEX FLOW; CONVEX FUNCTIONS; CONVEX PROGRAMMING; COST FLOW; GUARANTEED DELIVERY; MAXIMUM FLOWS; PENALTY FUNCTION; PRECOMPUTE; REAL-WORLD GRAPHS; SCALABLE ALGORITHMS; SCALABLE METHODS; SUCCINCT REPRESENTATION; SUPPLY-DEMAND;

ALGORITHMS; COST ACCOUNTING; SCALABILITY;

COMBINATORIAL MATHEMATICS;

EID: 77956200903     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1835804.1835872     Document Type: Conference Paper

References (15)

1. A. Agrawal, P. N. Klein, and R. Ravi. When trees collide: An approximation algorithm for the generalized Steiner problem on networks. In Proc. 23rd STOC, pages 134-144, 1991.
2. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network Flows: Theory, Algorithms and Applications. Prentice Hall, 1993.
3. M. Babaioff, J. Hartline, and R. Kleinberg. Selling banner ads: Online algorithms with buyback. In Proc. 4th Workshop on Ad Auctions, 2008.
4. R. Bar-Yehuda and S. Even. A linear-time approximation algorithm for the weighted vertex cover problem. J. Algorithms, 2(2):198-203, 1981.
5. F. Constantin, J. Feldman, S. Muthukrishnan, and M. Pál. An online mechanism for ad slot reservations with cancellations. In Proc. 19th SODA, pages 1265-1274, 2009.
6. N. R. Devanur and T. P. Hayes. The adwords problem: online keyword matching with budgeted bidders under random permutations. In Proc. 10th EC, pages 71-78, 2009.
7. N. R. Devanur, C. H. Papadimitriou, A. Saberi, and V. V. Vazirani. Market equilibrium via a primal-dual algorithm for a convex program. J. ACM, 55(5), 2008.
8. B. Edelman, M. Ostrovsky, and M. Schwarz. Internet advertising and the generalized second price auction: Selling billions of dollars worth of keywords. American Economic Review, 97(1):242-259, 2007.
9. U. Feige, N. Immorlica, V. Mirrokni, and H. Nazerzadeh. A combinatorial allocation mechanism with penalties for banner advertising. In Proc. 17th WWW, pages 169-178, 2008.
10. A. Ghosh, P. McAfee, K. Papineni, and S. Vassilvitskii. Bidding for representative allocations for display advertising. In Proc. 5th WINE, pages 208-219, 2009.
11. A. V. Goldberg. An efficient implementation of a scaling minimum-cost flow algorithm. J. Algorithms, 2:1-29, 1997.
12. A. V. Goldberg and R. E. Tarjan. A new approach to the maximum-flow problem. J. ACM, 35(4):921-940, 1988.
13. K. Jain and V. V. Vazirani. Eisenberg-Gale markets: Algorithms and structural properties. In Proc. 39th STOC, pages 364-373, 2007.
14. P. McAfee and K. Papineni. Maximally representative allocation for guaranteed delivery advertising campaigns, 2008. Manuscript.
15. E. Vee, S. Vassilvitskii, and J. Shanmugasundaram. Online allocation with a compact plan. In Proc. 11th EC, 2010.