Summary: Improved Approximation Algorithms for
Budgeted Allocations
Yossi Azar1
, Benjamin Birnbaum2
, Anna R. Karlin2
, Claire Mathieu3
, and
C. Thach Nguyen2
1
Microsoft Research and Tel-Aviv University
azar@tau.ac.il
2
University of Washington
@cs.washington.edu
3
Brown University
claire@cs.brown.edu
Abstract. We provide a 3/2-approximation algorithm for an offline
budgeted allocations problem with applications to sponsored search auc-
tions. This an improvement over the e/(e-1) approximation of Andelman

Source: Anderson, Richard - Department of Computer Science and Engineering, University of Washington at Seattle

Collections: Computer Technologies and Information Sciences