An optimal algorithm for on-line bipartite matching
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
An approximation algorithm for the generalized assignment problem
Mathematical Programming: Series A and B
A PTAS for the multiple knapsack problem
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
AdWords and Generalized On-line Matching
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Tight approximation algorithms for maximum general assignment problems
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
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
Online budgeted matching in random input models with applications to Adwords
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
A combinatorial allocation mechanism with penalties for banner advertising
Proceedings of the 17th international conference on World Wide Web
Optimal approximation for the submodular welfare problem in the value oracle model
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Improved Approximation Algorithms for Budgeted Allocations
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
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
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Selling ad campaigns: online algorithms with cancellations
Proceedings of the 10th ACM conference on Electronic commerce
The adwords problem: online keyword matching with budgeted bidders under random permutations
Proceedings of the 10th ACM conference on Electronic commerce
Algorithms for Secretary Problems on Graphs and Hypergraphs
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
The Design of Competitive Online Algorithms via a Primal: Dual Approach
Foundations and Trends® in Theoretical Computer Science
Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Online Stochastic Matching: Beating 1-1/e
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
Online primal-dual algorithms for maximizing ad-auctions revenue
ESA'07 Proceedings of the 15th annual European conference on Algorithms
How to allocate goods in an online market?
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part II
Online stochastic packing applied to display ad allocation
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Buyback problem: approximate matroid intersection with cancellation costs
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Frequency capping in online advertising
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Simultaneous approximations for adversarial and stochastic online budgeted allocation
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Online stochastic weighted matching: improved approximation algorithms
WINE'11 Proceedings of the 7th international conference on Internet and Network Economics
Online prophet-inequality matching with applications to ad allocation
Proceedings of the 13th ACM Conference on Electronic Commerce
Online allocation of display ads with smooth delivery
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
Optimizing budget constrained spend in search advertising
Proceedings of the sixth ACM international conference on Web search and data mining
Whole-page optimization and submodular welfare maximization with online bidders
Proceedings of the fourteenth ACM conference on Electronic commerce
New online algorithms for story scheduling in web advertising
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
Partner tiering in display advertising
Proceedings of the 7th ACM international conference on Web search and data mining
| Hi-index | 0.00 |
We study an online weighted assignment problem with a set of fixed nodes corresponding to advertisers and online arrival of nodes corresponding to ad impressions. Advertiser a has a contract for n(a) impressions, and each impression has a set of weighted edges to advertisers. The problem is to assign the impressions online so that while each advertiser a gets n(a) impressions, the total weight of edges assigned is maximized.Our insight is that ad impressions allow for free disposal, that is, advertisers are indifferent to, or prefer being assigned more than n(a) impressions without changing the contract terms. This means that the value of an assignment only includes the n(a) highest-weighted items assigned to each node a. With free disposal, we provide an algorithm for this problem that achieves a competitive ratio of 1 驴 1/e against the offline optimum, and show that this is the best possible ratio. We use a primal/dual framework to derive our results, applying a novel exponentially-weighted dual update rule. Furthermore, our algorithm can be applied to a general set of assignment problems including the ad words problem as a special case, matching the previously known 1 驴 1/e competitive ratio.