Budget constrained bidding in keyword auctions and online knapsack problems

Proceeding of the 17th International Conference on World Wide Web 2008, WWW'08

Volumn , Issue , 2008, Pages 1243-1244

  Zhou, Yunhong ^a   Chakrabarty, Deeparnab ^b   Lukose, Rajan ^a  

^a HEWLETT PACKARD LABORATORIES   (United States)

^b Georgia Institute of Technology   (United States)

Author keywords

Keyword bidding; Multiple choice knapsack problem; Online knapsack problem; Sponsored search auction

Indexed keywords

AND MODELS; BIDDING ALGORITHMS; BIDDING DATUMS; BIDDING STRATEGIES; KEYWORD BIDDING; KNAPSACK PROBLEMS; MULTIPLE-CHOICE KNAPSACK PROBLEM; ONLINE KNAPSACK PROBLEM; OPTIMAL COMPETITIVE RATIOS; OPTIMIZATION PROBLEMS; PERFORMANCE RATIOS; RANDOMIZED ALGORITHMS; REVENUE MAXIMIZATIONS; SPONSORED SEARCH AUCTION; SYNTHETIC DATUMS;

BUDGET CONTROL; COMMERCE; HEURISTIC ALGORITHMS; INDUSTRIAL ECONOMICS; INTEGER PROGRAMMING; INTERNET; OPTIMIZATION; WORLD WIDE WEB;

CONSTRAINED OPTIMIZATION;

EID: 57349086248     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1367497.1367747     Document Type: Conference Paper

References (6)

1. Overture view bids, available until Febuary 2007. http://uv.bidtool. overture.com/d/search/tools/bidtool
2. B. Awerbuch, Y. Azar, and S. A. Plotkin. Throughput-competitive on-line routing. In FOGS, pages 32-40, 1993.
3. N. Buchbinder, K. Jain, and J. S. Naor. Online primal-dual algorithms for maximizing ad-auctions revenue. In Proc. ESA, pages 253-264, 2007.
4. A. Marchetti-Spaccamela and C. Vercellis. Stochastic on-line knapsack problems. Math. Programming, 68:73-104, 1995.
5. A. Mehta, A. Saberi, U. V. Vazirani, and V. V. Vazirani. Adwords and generalized on-line matching. In Proc. FOCS, pages 264-273, 2005.
6. Y. Zhou, D. Chakrabarty. and R. Lukose. Budget Constrained Bidding in Keyword Auctions and Online Knapsack Problems. HP Labs tech report HPL-2008-9, 2008.