Budget constrained bidding in keyword auctions and online knapsack problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5385 LNCS, Issue , 2008, Pages 566-576

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

^a Rocket Fuel Inc   (United States)

^b GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

^c HEWLETT PACKARD LABORATORIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BIDDING ALGORITHMS; BIDDING DATUM; BIDDING STRATEGIES; KNAPSACK PROBLEMS; OPTIMAL COMPETITIVE RATIOS; OPTIMIZATION PROBLEMS; PARAMETER-TUNING; PERFORMANCE RATIOS; RANDOMIZED ALGORITHMS; REVENUE MAXIMIZATIONS; SPONSORED SEARCH AUCTIONS; SYNTHETIC DATUM;

BUDGET CONTROL; COMMERCE; ECONOMICS; HEURISTIC ALGORITHMS; INDUSTRIAL ECONOMICS; INTEGER PROGRAMMING; INTERNET; OPTIMIZATION; WINE;

CONSTRAINED OPTIMIZATION;

EID: 58849145615     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-92185-1_63     Document Type: Conference Paper

References (6)

1. Overture view bids (Febuary 2007), http://uv.bidtool.overture.com/d/ search/tools/bidtool
2. Awerbuch, B., Azar, Y., Plotkin, S.A.: Throughput-competitive on-line routing. In:FOCS, pp. 32-40 (1993)
3. Buchbinder, N., Jain, K., Naor, J.S.: Online primal-dual algorithms for maximizing ad-auctions revenue. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol. 4698, pp. 253-264. Springer, Heidelberg (2007)
4. Marchetti-Spaccamela, A., Vercellis, C.: Stochastic on-line knapsack problems. Mathematical Programming 68, 73-104 (1995)
5. Mehta, A., Saberi, A., Vazirani, U.V., Vazirani, V.V.: Adwords and generalized on-line matching. In: Proc. FOCS, pp. 264-273 (2005)
6. Yao, A.C.-C.: Probabilistic computations: towards a unified measure of complexity. In: Proc. 18th IEEE FOCS, pp. 222-227 (1977)