Amortized efficiency of list update and paging rules
Communications of the ACM
Randomized algorithms
The Design and Implementation of a Secure Auction Service
IEEE Transactions on Software Engineering
Online computation and competitive analysis
Online computation and competitive analysis
Algorithmic mechanism design (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Sharing the cost of muliticast transmissions (preliminary version)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Truth revelation in approximately efficient combinatorial auctions
Proceedings of the 1st ACM conference on Electronic commerce
Economic mechanism design for computerized agents
WOEC'95 Proceedings of the 1st conference on USENIX Workshop on Electronic Commerce - Volume 1
On approximating optimal auctions
Proceedings of the 3rd ACM conference on Electronic Commerce
Competitive generalized auctions
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Incentive-compatible online auctions for digital goods
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Online algorithms for market clearing
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
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
An approximate truthful mechanism for combinatorial auctions with single parameter agents
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Competitive Auctions for Multiple Digital Goods
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Truthful and Competitive Double Auctions
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Profit-maximizing multicast pricing by approximating fixed points [Extended Abstract]
Proceedings of the 4th ACM conference on Electronic commerce
Reducing truth-telling online mechanisms to online optimization
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Competitive analysis of incentive compatible on-line auctions
Theoretical Computer Science
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Adaptive limited-supply online auctions
EC '04 Proceedings of the 5th ACM conference on Electronic commerce
Randomized truthful auctions of digital goods are randomizations over truthful auctions
EC '04 Proceedings of the 5th ACM conference on Electronic commerce
Online learning in online auctions
Theoretical Computer Science - Special issue: Online algorithms in memoriam, Steve Seiden
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Multi-unit auctions with budget-constrained bidders
Proceedings of the 6th ACM conference on Electronic commerce
From optimal limited to unlimited supply auctions
Proceedings of the 6th ACM conference on Electronic commerce
Collusion-resistant mechanisms for single-parameter agents
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
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
Mechanism Design via Machine Learning
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Revenue maximization when bidders have budgets
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Single-minded unlimited supply pricing on sparse instances
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Approximation algorithms and online mechanisms for item pricing
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
Multi-unit auctions with unknown supply
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
Online pricing for web service providers
Proceedings of the 2006 international workshop on Economics driven software engineering research
Posted price profit maximization for multicast by approximating fixed points
Journal of Algorithms
Computationally efficient and revenue optimized auctioneer's strategy for expanding auctions
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Online algorithms for market clearing
Journal of the ACM (JACM)
Worst-case optimal redistribution of VCG payments
Proceedings of the 8th ACM conference on Electronic commerce
Pricing of partially compatible products
Proceedings of the 8th ACM conference on Electronic commerce
Frugality ratios and improved truthful mechanisms for vertex cover
Proceedings of the 8th ACM conference on Electronic commerce
Buying cheap is expensive: hardness of non-parametric multi-product pricing
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Dynamic pricing for impatient bidders
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Designing and learning optimal finite support auctions
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Performance of the Vickrey auction for digital goods under various bid distributions
Performance Evaluation
Limited verification of identities to induce false-name-proofness
TARK '07 Proceedings of the 11th conference on Theoretical aspects of rationality and knowledge
Mechanism design, machine learning, and pricing problems
ACM SIGecom Exchanges
Auctions for structured procurement
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Unconditional competitive auctions with copy and budget constraints
Theoretical Computer Science
Optimal mechanism design and money burning
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Item pricing for revenue maximization
Proceedings of the 9th ACM conference on Electronic commerce
Online auctions and generalized secretary problems
ACM SIGecom Exchanges
Reducing mechanism design to algorithm design via machine learning
Journal of Computer and System Sciences
Limited and online supply and the bayesian foundations of prior-free mechanism design
Proceedings of the 10th ACM conference on Electronic commerce
On random sampling auctions for digital goods
Proceedings of the 10th ACM conference on Electronic commerce
Approximating revenue-maximizing combinatorial auctions
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Auctions with severely bounded communication
Journal of Artificial Intelligence Research
A New Derandomization of Auctions
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
Auctions with revenue guarantees for sponsored search
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
Budget constrained auctions with heterogeneous items
Proceedings of the forty-second ACM symposium on Theory of computing
Incentive compatible budget elicitation in multi-unit auctions
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Analysis of an automated auction with concurrent multiple unit acceptance capacity
ASMTA'10 Proceedings of the 17th international conference on Analytical and stochastic modeling techniques and applications
Optimizing merchant revenue with rebates
Proceedings of the fourth ACM international conference on Web search and data mining
Envy-free pricing with general supply constraints
WINE'10 Proceedings of the 6th international conference on Internet and network economics
Truthful randomized mechanisms for combinatorial auctions
Journal of Computer and System Sciences
Unconditional competitive auctions with copy and budget constraints
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
Truthful auctions with optimal profit
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
Bayesian optimal no-deficit mechanism design
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
Making economic theory operational
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
A simple characterization for truth-revealing single-item auctions
WINE'05 Proceedings of the First international conference on Internet and Network Economics
On the competitive ratio of the random sampling auction
WINE'05 Proceedings of the First international conference on Internet and Network Economics
On behalf of the seller and society: bicriteria mechanisms for unit-demand auctions
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Buying Cheap Is Expensive: Approximability of Combinatorial Pricing Problems
SIAM Journal on Computing
Generalized Partition Mechanism: Framework for Combining Multiple Strategy-Proof Mechanisms
WI-IAT '12 Proceedings of the The 2012 IEEE/WIC/ACM International Joint Conferences on Web Intelligence and Intelligent Agent Technology - Volume 02
Selling in Exclusive Markets: Some Observations on Prior-Free Mechanism Design
ACM Transactions on Economics and Computation - Special Issue on Algorithmic Game Theory
Mechanism Design via Consensus Estimates, Cross Checking, and Profit Extraction
ACM Transactions on Economics and Computation - Special Issue on Algorithmic Game Theory
Prior-free auctions for budgeted agents
Proceedings of the fourteenth ACM conference on Electronic commerce
Truthful incentives in crowdsourcing tasks using regret minimization mechanisms
Proceedings of the 22nd international conference on World Wide Web
Revenue monotone mechanisms for online advertising
Proceedings of the 23rd international conference on World wide web
| Hi-index | 0.00 |
We study a class of single round, sealed bid auctions for items in unlimited supply such as digital goods. We focus on auctions that are truthful and competitive. Truthful auctions encourage bidders to bid their utility; competitive auctions yield revenue within a constant factor of the revenue for optimal fixed pricing. We show that for any truthful auction, even a multi-price auction, the expected revenue does not exceed that for optimal fixed pricing. We also give a bound on how far the revenue for optimal fixed pricing can be from the total market utility. We show that several randomized auctions are truthful and competitive under certain assumptions, and that no truthful deterministic auction is competitive. We present simulation results which confirm that our auctions compare favorably to fixed pricing. Some of our results extend to bounded supply markets, for which we also get truthful and competitive auctions.