On the complexity of approximating the independent set problem
Information and Computation
Computational Complexity
Combinatorial optimization
Proof verification and the hardness of approximation problems
Journal of the ACM (JACM)
Algorithmic mechanism design (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Truth revelation in approximately efficient combinatorial auctions
Proceedings of the 1st ACM conference on Electronic commerce
Competitive auctions and digital goods
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Algorithms, games, and the internet
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Competitive generalized auctions
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Approximating the Domatic Number
SIAM Journal on Computing
An approximate truthful mechanism for combinatorial auctions with single parameter agents
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Incentive compatible multi unit combinatorial auctions
Proceedings of the 9th conference on Theoretical aspects of rationality and knowledge
Algorithms for approximate graph coloring
Algorithms for approximate graph coloring
Towards a Characterization of Truthful Combinatorial Auctions
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Approximation techniques for utilitarian mechanism design
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
On profit-maximizing envy-free pricing
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
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
An improved approximation algorithm for combinatorial auctions with submodular bidders
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
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
A Nonparametric Approach to Multiproduct Pricing
Operations Research
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Greedy approximation via duality for packing, combinatorial auctions and routing
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Pricing network edges to cross a river
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
Near-optimal pricing in near-linear time
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Algorithmic pricing via virtual valuations
Proceedings of the 8th ACM conference on Electronic commerce
Optimal envy-free pricing with metric substitutability
Proceedings of the 9th ACM conference on Electronic commerce
On the approximability of the maximum feasible subsystem problem with 0/1-coefficients
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
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
A quasi-PTAS for profit-maximizing pricing on line graphs
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Pricing commodities, or how to sell when buyers have restricted valuations
WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
Theoretical Computer Science
Improved hardness of approximation for stackelberg shortest-path pricing
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
Symmetries and optimal multi-dimensional mechanism design
Proceedings of the 13th ACM Conference on Electronic Commerce
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
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
Online pricing for bundles of multiple items
Journal of Global Optimization
| Hi-index | 0.00 |
We investigate non-parametric unit-demand pricing problems, in which we want to find revenue maximizing prices for products P based on a set of consumer profiles C. A consumer profile consists of a number of non-zero budgets for different products and possibly an additional product ranking. Once prices are fixed, each consumer chooses to buy one of the products she can afford based on some predefined selection rule. We distinguish between the min-buying, max-buying, and rank-buying models. For the min-buying model we show that it is not approximable within O(logε |C|) for some constant ε 0, unless NP ⊆ DTIME(nO(loglogn(), thereby closing the gap between the known algorithmic results and previous lower bounds. We also prove inapproximability within O(ℓε), ℓ being an upper bound on the number of non-zero budgets per consumer, and O(|P|epsi;) under slightly stronger assumptions and provide matching upper bounds. Surprisingly, these hardness results hold even if a price ladder constraint, i.e., a predefined order on the prices of all products, is given. For the max-buying model a PTAS exists if a price ladder is given. We give a matching lower bound by proving strong NP-hardness. Assuming limited product supply, we analyze a generic local search algorithm and prove that it is 2-approximate. Finally, we discuss implications for the rank-buying model.