Budgeted Allocations in the Full-Information Setting

Authors:
Aravind Srinivasan
Affiliations:
Dept. of Computer Science and Institute for Advanced Computer Studies, University of Maryland, College Park MD 20742
Venue:
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Year:
2008

Citing 8
Cited 6

Approximation Algorithms for Budget-Constrained Auctions

APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
Distributions on Level-Sets with Applications to Approximation Algorithms

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Dependent rounding and its applications to approximation algorithms

Journal of the ACM (JACM)
Approximation algorithms for allocation problems: Improving the factor of 1 - 1/e

FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
AdWords and generalized online matching

Journal of the ACM (JACM)
Online budgeted matching in random input models with applications to Adwords

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Improved Approximation Algorithms for Budgeted Allocations

ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
Online primal-dual algorithms for maximizing ad-auctions revenue

ESA'07 Proceedings of the 15th annual European conference on Algorithms

Online Ad Assignment with Free Disposal

WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Improved bounds for online stochastic matching

ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Online stochastic packing applied to display ad allocation

ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
On the Approximability of Budgeted Allocations and Improved Lower Bounds for Submodular Welfare Maximization and GAP

SIAM Journal on Computing
AdCell: ad allocation in cellular networks

ESA'11 Proceedings of the 19th European conference on Algorithms
Second-Price ad auctions with binary bids and markets with good competition

ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

We build on the work of Andelman & Mansour and Azar, Birnbaum, Karlin, Mathieu & Thach Nguyen to show that the full-information (i.e., offline) budgeted-allocation problem can be approximated to within 4/3: we conduct a rounding of the natural LP relaxation, for which our algorithm matches the known lower-bound on the integrality gap.