Toward Expressive and Scalable Sponsored Search Auctions

Details Toward Expressive and Scalable Sponsored Search Auctions Toward Expressive and Scalable Sponsored Search Auctions

2008-08-31

arxiv.org/abs/0809.0116v1

David J. Martin, Johannes Gehrke, and Joseph Y. Halpern. Toward Expressive and Scalable Sponsored Search Auctions. In Proceedi

Computer Science

Databases

10 pages, 13 figures, ICDE 2008

Scientific paper

Internet search results are a growing and highly profitable advertising platform. Search providers auction advertising slots to advertisers on their search result pages. Due to the high volume of searches and the users' low tolerance for search result latency, it is imperative to resolve these auctions fast. Current approaches restrict the expressiveness of bids in order to achieve fast winner determination, which is the problem of allocating slots to advertisers so as to maximize the expected revenue given the advertisers' bids. The goal of our work is to permit more expressive bidding, thus allowing advertisers to achieve complex advertising goals, while still providing fast and scalable techniques for winner determination.

Affiliated with

Also associated with

No associations

Rating

Toward Expressive and Scalable Sponsored Search Auctions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Toward Expressive and Scalable Sponsored Search Auctions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Toward Expressive and Scalable Sponsored Search Auctions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-578598