Randomized algorithms
Efficient approximation of product distributions
Random Structures & Algorithms
Competitive auctions and digital goods
SODA '01 Proceedings of the twelfth 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
Pairwise Independence and Derandomization
Pairwise Independence and Derandomization
Adaptive routing with end-to-end feedback: distributed learning and geometric approaches
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
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
Combination can be hard: approximability of the unique coverage problem
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Robbing the bandit: less regret in online geometric optimization against an adaptive adversary
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
Efficient algorithms for online decision problems
Journal of Computer and System Sciences - Special issue: Learning theory 2003
Near-optimal pricing in near-linear time
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Playing games with approximation algorithms
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Algorithmic pricing via virtual valuations
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
Mechanism design, machine learning, and pricing problems
ACM SIGecom Exchanges
Item pricing for revenue maximization
Proceedings of the 9th ACM conference on Electronic commerce
Optimal envy-free pricing with metric substitutability
Proceedings of the 9th ACM conference on Electronic commerce
Reducing mechanism design to algorithm design via machine learning
Journal of Computer and System Sciences
Algorithms for Optimal Price Regulations
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Improved Approximation Algorithms for Item Pricing with Bounded Degree and Valuation
IEICE - Transactions on Information and Systems
On Profit-Maximizing Pricing for the Highway and Tollbooth Problems
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
On the Complexity of the Highway Pricing Problem
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
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
A quasi-PTAS for profit-maximizing pricing on line graphs
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Bundle pricing with comparable items
ESA'07 Proceedings of the 15th annual European conference on Algorithms
A theory of loss-leaders: making money by pricing below cost
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
Pricing commodities, or how to sell when buyers have restricted valuations
WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
The power of randomness in bayesian optimal mechanism design
Proceedings of the 11th ACM conference on Electronic commerce
Envy-free pricing in multi-item markets
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Theoretical Computer Science
Envy-free pricing with general supply constraints
WINE'10 Proceedings of the 6th international conference on Internet and network economics
The power of uncertainty: bundle-pricing for unit-demand customers
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
Optimal Envy-Free Pricing with Metric Substitutability
SIAM Journal on Computing
How to sell a graph: guidelines for graph retailers
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
On the hardness of pricing loss-leaders
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Pricing on paths: a PTAS for the highway problem
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Optimal bundle pricing with monotonicity constraint
Operations Research Letters
A QPTAS for ε-envy-free profit-maximizing pricing on line graphs
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
On the complexity of the highway problem
Theoretical Computer Science
A path-decomposition theorem with applications to pricing and covering on trees
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Envy-free pricing in multi-item markets
ACM Transactions on Algorithms (TALG)
Hi-index | 0.00 |
We present approximation and online algorithms for a number of problems of pricing items for sale so as to maximize seller's revenue in an unlimited supply setting. Our first result is an O(k)-approximation algorithm for pricing items to single-minded bidders who each want at most k items. This improves over recent independent work of Briest and Krysta [5] who achieve an O(k2) bound. For the case k = 2, where we obtain a 4-approximation, this can be viewed as the following graph vertex pricing problem: given a (multi) graph G with valuations we on the edges, find prices pi ≥ 0 for the vertices to maximize Σ (pi + pj). {e=(i,j):we ≥ pi + pj.We also improve the approximation of Guruswami et al. [11] from O(log m + log n) to O(log n), where m is the number of bidders and n is the number of items, for the "highway problem" in which all desired subsets are intervals on a line.Our approximation algorithms can be fed into the generic reduction of Balcan et al. [2] to yield an incentive-compatible auction with nearly the same performance guarantees so long as the number of bidders is sufficiently large. In addition, we show how our algorithms can be combined with results of Blum and Hartline [3], Blum et al. [4], and Kalai and Vempala [13] to achieve good performance in the online setting, where customers arrive one at a time and each must be presented a set of item prices based only on knowledge of the customers seen so far.