Competitive auctions and digital goods
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Competitive generalized auctions
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Truth revelation in approximately efficient combinatorial auctions
Journal of the ACM (JACM)
On profit-maximizing envy-free pricing
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Combinatorial Auctions
Mechanism Design via Machine Learning
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Truthful and Near-Optimal Mechanism Design via Linear Programming
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Combination can be hard: approximability of the unique coverage problem
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
On maximizing welfare when utility functions are subadditive
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Truthful randomized mechanisms for combinatorial auctions
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Approximation algorithms and online mechanisms for item pricing
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
Mechanisms for multi-unit auctions
Proceedings of the 8th ACM conference on Electronic commerce
Algorithmic Game Theory
Two Randomized Mechanisms for Combinatorial Auctions
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
A quasi-PTAS for profit-maximizing pricing on line graphs
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Near-optimal pricing in near-linear time
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Item pricing for revenue maximization
ACM SIGecom Exchanges
On Multi-dimensional Envy-Free Mechanisms
ADT '09 Proceedings of the 1st International Conference on Algorithmic Decision Theory
The Balloon Popping Problem Revisited: Lower and Upper Bounds
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
On Profit-Maximizing Pricing for the Highway and Tollbooth Problems
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
On Stackelberg Pricing with Computationally Bounded Consumers
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Envy, Multi Envy, and Revenue Maximization
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
The power of randomness in bayesian optimal mechanism design
Proceedings of the 11th ACM conference on Electronic commerce
A sublogarithmic approximation for highway and tollbooth pricing
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Envy-free pricing in multi-item markets
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Sequential item pricing for unlimited supply
WINE'10 Proceedings of the 6th international conference on Internet and network economics
Approximation schemes for sequential posted pricing in multi-unit auctions
WINE'10 Proceedings of the 6th international conference on Internet and network economics
Improved hardness of approximation for stackelberg shortest-path pricing
WINE'10 Proceedings of the 6th international conference on Internet and network economics
Approximation algorithms for non-single-minded profit-maximization problems with limited supply
WINE'10 Proceedings of the 6th international conference on Internet and network economics
Proceedings of the forty-third annual ACM symposium on Theory of computing
Competitive algorithms for online pricing
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Truthful randomized mechanisms for combinatorial auctions
Journal of Computer and System Sciences
Optimal Envy-Free Pricing with Metric Substitutability
SIAM Journal on Computing
The power of fair pricing mechanisms
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Optimization with demand oracles
Proceedings of the 13th ACM Conference on Electronic Commerce
Revenue maximizing envy-free multi-unit auctions with budgets
Proceedings of the 13th ACM Conference on Electronic Commerce
Buying Cheap Is Expensive: Approximability of Combinatorial Pricing Problems
SIAM Journal on Computing
On envy-free pareto efficient pricing
FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
Online pricing for multi-type of items
FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
ECML PKDD'12 Proceedings of the 2012 European conference on Machine Learning and Knowledge Discovery in Databases - Volume Part II
Using lotteries to approximate the optimal revenue
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Combinatorial walrasian equilibrium
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Envy-free pricing in multi-item markets
ACM Transactions on Algorithms (TALG)
Online pricing for bundles of multiple items
Journal of Global Optimization
Hi-index | 0.01 |
We consider the problem of pricing n items to maximize revenue when faced with a series of unknown buyers with complex preferences, and show that a simple pricing scheme achieves surprisingly strong guarantees. We show that in the unlimited supply setting, a random single price achieves expected revenue within a logarithmic factor of the total social welfare for customers with general valuation functions, which may not even necessarily be monotone. This generalizes work of Guruswami et. al [18], who show a logarithmic factor for only the special cases of single-minded and unit-demand customers. In the limited supply setting, we show that for subadditive valuations, a random single price achieves revenue within a factor of 2O(√(log n loglog n) of the total social welfare, i.e., the optimal revenue the seller could hope to extract even if the seller could price each bundle differently for every buyer. This is the best approximation known for any item pricing scheme for subadditive (or even submodular) valuations, even using multiple prices. We complement this result with a lower bound showing a sequence of subadditive (in fact, XOS) buyers for which any single price has approximation ratio 2Ω(log1/4 n), thus showing that single price schemes cannot achieve a polylogarithmic ratio. This lower bound demonstrates a clear distinction between revenue maximization and social welfare maximization in this setting, for which [12,10] show that a fixed price achieves a logarithmic approximation in the case of XOS [12], and more generally subadditive [10], customers. We also consider the multi-unit case examined by [1111] in the context of social welfare, and show that so long as no buyer requires more than a 1 -- ε fraction of the items, a random single price now does in fact achieve revenue within an O(log n) factor of the maximum social welfare.