Improved Approximation Algorithms for Budgeted Allocations

Authors:
Yossi Azar;Benjamin Birnbaum;Anna R. Karlin;Claire Mathieu;C. Thach Nguyen
Affiliations:
Microsoft Research and Tel-Aviv University, ;University of Washington, ;University of Washington, ;Brown University, ;University of Washington,
Venue:
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
Year:
2008

Citing 0
Cited 8

Budgeted Allocations in the Full-Information Setting

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
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
Repeated budgeted second price ad auction

SAGT'11 Proceedings of the 4th international conference on Algorithmic game theory
Repeated Budgeted Second Price Ad Auction

Theory of Computing Systems

Quantified Score

Hi-index	0.03

Visualization

Abstract

On the Internet, there are advertisements (ads) of different kinds: image, text, video and other specially marked objects that are distinct from the underlying content of the page. There is an industry behind the management of such ads, and they face ...