Competitive queueing policies for QoS switches
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
RANDOM-APPROX '99 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization Problems: Randomization, Approximation, and Combinatorial Algorithms and Techniques
Buffer Overflow Management in QoS Switches
SIAM Journal on Computing
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
SIAM Journal on Computing
Dynamics of bid optimization in online advertisement auctions
Proceedings of the 16th international conference on World Wide Web
Better online buffer management
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Considering suppressed packets improves buffer management in QoS switches
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Fast approximation algorithms for knapsack problems
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Truthful Unification Framework for Packing Integer Programs with Choices
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
Prompt Mechanisms for Online Auctions
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
Budget Constrained Bidding in Keyword Auctions and Online Knapsack Problems
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Truthful Mechanisms via Greedy Iterative Packing
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Hi-index | 0.01 |
Consider video ad placement into commercial breaks in a television channel. The ads arrive online over time and each has an expiration date. The commercial breaks are typically of some uniform duration; however, the video ads may have an arbitrary size. Each ad has a private value and should be posted into some break at most once by its expiration date. The player who own the ad gets her value if her ad had been broadcasted by the ad's expiration date (obviously, after ad's arrival date), and zero value otherwise. Arranging the ads into the commercial breaks while maximizing the players' profit is a classical problem of ad placement subject to the capacity constraint that should be solved truthfully. However, we are interested not only in truthfulness but also in a prompt mechanism where the payment is determined for an agent at the very moment of the broadcast. The promptness of the mechanism is a crucial requirement for our algorithm, since it allows a payment process without any redundant relation between an auctioneer and players. An inability to resolve this problem could even prevent the application of such mechanisms in a real marketing process. We design a 6-approximation prompt mechanism for the problem. Previously Cole et al considered a special case where all ads have the same size which is equal to the break duration. For this particular case they achieved a 2-approximation prompt mechanism. The general case of ads with arbitrary size is considerably more involved and requires designing a new algorithm, which we call the Gravity Algorithm.