This website uses cookies.
We use cookies to improve your online experience. By continuing to use our website we assume you agree to the placement of these cookies.
To learn more, you can find in our Privacy Policy.
Original paper

AdWords and Generalized On-line Matching

Pages: 264 - 273
Published: Nov 15, 2005
Abstract
How does a search engine company decide what ads to display with each query so as to maximize its revenue? This turns out to be a generalization of the online bipartite matching problem. We introduce the notion of a tradeoff revealing LP and use it to derive two optimal algorithms achieving competitive ratios of 1-1/e for this...
Paper Details
Title
AdWords and Generalized On-line Matching
Published Date
Nov 15, 2005
Pages
264 - 273
© 2025 Pluto Labs All rights reserved.
Step 1. Scroll down for details & analytics related to the paper.
Discover a range of citation analytics, paper references, a list of cited papers, and more.