Skip to main content.

Platinum Sponsors

Gold Sponsors

Silver Sponsors

Bronze Sponsors

Wi-Fi Hardware Sponsor

Banquet Sponsor

Conference Bag and T-Shirts Sponsor

Conference Flash Disk Sponsor

Conference Welcome Reception Sponsor

Conference VIP Dinner Sponsor

Organizers

Beihang University

Host of the Conference Series

International World Wide Web Conferences Steering Committee

In Cooperation With

ACM SIGWEB
ACM SIGecom

China Computer Federation

International Federation for Information Processing

World Wide Web Consortium

Sponsors are Listed In Alphabetic Order

Poster

Track: Posters

Paper Title:
Algorithm for Stochastic Multiple-Choice Knapsack Problem and Application to Keywords Bidding

Authors:

Yunhong Zhou(HP Labs)
Victor Naroditskiy(Brown University)

Abstract:
We model budget-constrained keyword bidding in sponsored search auctions as a stochastic multiple-choice knapsack problem (S-MCKP) and design an algorithm to solve S-MCKP and the corresponding bidding optimization problem. Our algorithm selects items online based on a threshold function which can be built/updated using historical data. Our algorithm achieved about 99% performance compared to the offline optimum when applied to a real bidding dataset. With synthetic dataset and iid item-sets, its performance ratio against the offline optimum converges to one empirically with increasing number of periods.

PDF version

Inquiries can be sent to: Email contact: program-chairs at www2008.org

**Sponsors are Listed In Alphabetic Order**

Poster

Sponsors are Listed In Alphabetic Order