Competitive auctions and digital goods
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Incentive-compatible online auctions for digital goods
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Online learning in online auctions
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
Journal of the ACM (JACM)
From optimal limited to unlimited supply auctions
Proceedings of the 6th ACM conference on Electronic commerce
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
On profit-maximizing envy-free pricing
SODA '05 Proceedings of the sixteenth 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
On the competitive ratio of the random sampling auction
WINE'05 Proceedings of the First international conference on Internet and Network Economics
Allocating online advertisement space with unreliable estimates
Proceedings of the 8th ACM conference on Electronic commerce
Prompt Mechanisms for Online Auctions
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
A Truthful Mechanism for Offline Ad Slot Scheduling
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
Limited and online supply and the bayesian foundations of prior-free mechanism design
Proceedings of the 10th ACM conference on Electronic commerce
The Design of Competitive Online Algorithms via a Primal: Dual Approach
Foundations and Trends® in Theoretical Computer Science
Automated online mechanism design and prophet inequalities
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
The Balloon Popping Problem Revisited: Lower and Upper Bounds
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
An Online Multi-unit Auction with Improved Competitive Ratio
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Online primal-dual algorithms for maximizing ad-auctions revenue
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Auctions with revenue guarantees for sponsored search
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
Proceedings of the 11th ACM conference on Electronic commerce
On the limitations of Greedy mechanism design for truthful combinatorial auctions
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
How to allocate goods in an online market?
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part II
Frequency capping in online advertising
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
| Hi-index | 0.00 |
We study multi-unit auctions for perishable goods, in a setting where the supply arrives online. This is motivated by its application in advertisement auctions on the internet. We give a 14 -competitive algorithm for computing the optimal single price auction assuming that all the agents report their bids truthfully. We use that algorithm to develop a truthful auction with a constant competitive ratio compared to the optimum offline single-price auction.