Optimal online assignment with forecasts

Proceedings of the ACM Conference on Electronic Commerce

Volumn , Issue , 2010, Pages 109-118

  Vee, Erik ^a   Vassilvitskii, Sergei ^a   Shanmugasundaram, Jayavel ^a  

^a YAHOO RESEARCH   (United States)

Author keywords

computational advertising; guaranteed delivery; online matching

Indexed keywords

ALLOCATION PLANS; ALLOCATION PROBLEMS; BIPARTITE MATCHINGS; CONVEX OBJECTIVES; DEMAND-SIDE; DUAL SPACES; GUARANTEED DELIVERY; INPUT GRAPHS; INTERNET USERS; LARGE CLASS; LINEAR SUPPLIES; NEAR-OPTIMAL SOLUTIONS; ON-LINE ALGORITHMS; ON-LINE MATCHING; ONLINE ASSIGNMENTS; ONLINE DECISIONS; PROBLEM INSTANCES; RANDOM SAMPLE;

CUSTOMER SATISFACTION; ELECTRONIC COMMERCE; FORECASTING; MOBILE TELECOMMUNICATION SYSTEMS;

OPTIMIZATION;

EID: 77954776935     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1807342.1807360     Document Type: Conference Paper

References (8)

1. Moses Charikar, Chandra Chekuri, and Martin Pál. Sampling bounds for stochastic optimization. In Chandra Chekuri, Klaus Jansen, José D. P. Rolim, and Luca Trevisan, editors, APPROX-RANDOM, volume 3624 of Lecture Notes in Computer Science, pages 257-269. Springer, 2005.
2. Nikhil R. Devenur 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.
3. Jon Feldman, Aranyak Mehta, Vahab S. Mirrokni, and S. Muthukrishnan. Online stochastic matching: Beating 1-1/e. 2009.
4. Arpita Ghosh, Preston McAfee, Kishore Papineni, and Sergei Vassilvitskii. Bidding for representative allocations for display advertising. In Stefano Leonardi, editor, WINE, volume 5929 of Lecture Notes in Computer Science, pages 208-219. Springer, 2009.
5. R. M. Karp, U. V. Vazirani, and V. V. Vazirani. An optimal algorithm for on-line bipartite matching. In STOC '90: Proceedings of the twenty-second annual ACM symposium on Theory of computing, pages 352-358, New York, NY, USA, 1990. ACM.
6. Aranyak Mehta, Amin Saberi, Umesh Vazirani, and Vijay Vazirani. Adwords and generalized online matching. J. ACM, 54(5):22, 2007.
7. David B. Shmoys and Chaitanya Swamy. An approximation scheme for stochastic linear programming and its application to stochastic integer programs. J. ACM, 53(6):978-1012, 2006.
8. Erik Vee, Sergei Vassilvitskii, and Jayavel Shanmugasundaram. Optimal online assignment with forecasts. Yahoo Technical Report 2009-005, 2009.