Sciweavers

ESA
2007
Springer

Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue

14 years 1 months ago
Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue
We study the online ad-auctions problem introduced by Mehta et. al. [15]. We design a (1 − 1/e)competitive (optimal) algorithm for the problem, which is based on a clean primal-dual approach, matching the competitive factor obtained in [15]. Our basic algorithm along with its analysis are very simple. Our results are based on a unified approach developed earlier for the design of online algorithms [7, 8]. In particular, the analysis uses weak duality rather than a tailor made (i.e., problem specific) potential function. We show that this approach is useful for analyzing other classical online algorithms such as ski rental and the TCP-acknowledgement problem. We are confident that the primal-dual method will prove useful in other online scenarios as well. The primal-dual approach enables us to extend our basic ad-auctions algorithm in a straight forward manner to scenarios in which additional information is available, yielding improved worst case competitive factors. In particular...
Niv Buchbinder, Kamal Jain, Joseph Naor
Added 07 Jun 2010
Updated 07 Jun 2010
Type Conference
Year 2007
Where ESA
Authors Niv Buchbinder, Kamal Jain, Joseph Naor
Comments (0)