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
On the complexity of equilibria
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Competitive generalized auctions
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
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
Market Equilibrium via a Primal-Dual-Type Algorithm
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Hardness of Approximating Problems on Cubic Graphs
CIAC '97 Proceedings of the Third Italian Conference on Algorithms and Complexity
Towards a Characterization of Truthful Combinatorial Auctions
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
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
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
ACM SIGACT News
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
Pricing of partially compatible products
Proceedings of the 8th ACM conference on Electronic commerce
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
On the importance of migration for fairness in online grid markets
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3
Reducing mechanism design to algorithm design via machine learning
Journal of Computer and System Sciences
Item pricing for revenue maximization
ACM SIGecom Exchanges
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
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
A new approach to auctions and resilient mechanism design
Proceedings of the forty-first annual ACM symposium on Theory of computing
On the importance of migration for fairness in online grid markets
GRID '08 Proceedings of the 2008 9th IEEE/ACM International Conference on Grid Computing
On Hardness of Pricing Items for Single-Minded Bidders
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Approximating revenue-maximizing combinatorial auctions
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
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 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
Envy-Free Allocations for Budgeted Bidders
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Dynamic pricing for impatient bidders
ACM Transactions on Algorithms (TALG)
Expressive auctions for externalities in online advertising
Proceedings of the 19th international conference on World wide web
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
Multi-parameter mechanism design and sequential posted pricing
Proceedings of the forty-second ACM symposium on Theory of computing
Budget constrained auctions with heterogeneous items
Proceedings of the forty-second ACM symposium on Theory of computing
Proceedings of the 11th ACM conference on Electronic commerce
The power of randomness in bayesian optimal mechanism design
Proceedings of the 11th ACM conference on Electronic commerce
Envy-free makespan approximation: extended abstract
Proceedings of the 11th ACM conference on Electronic commerce
Pricing randomized allocations
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
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
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
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
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
Maximum utility product pricing models and algorithms based on reservation price
Computational Optimization and Applications
A revealed preference approach to computational complexity in economics
Proceedings of the 12th ACM conference on Electronic commerce
Proceedings of the 12th ACM conference on Electronic commerce
On optimal single-item auctions
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
Multi-parameter mechanism design under budget and matroid constraints
ESA'11 Proceedings of the 19th European conference on Algorithms
Optimal Envy-Free Pricing with Metric Substitutability
SIAM Journal on Computing
Truthful auctions with optimal profit
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
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
Walrasian equilibrium: hardness, approximations and tractable instances
WINE'05 Proceedings of the First international conference on Internet and Network Economics
The power of fair pricing mechanisms
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
The complexity of making unique choices: approximating 1-in-k SAT
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Pricing on paths: a PTAS for the highway problem
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Bayesian incentive compatibility via fractional assignments
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Near-optimal pricing in near-linear time
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
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
A global characterization of envy-free truthful scheduling of two tasks
WINE'11 Proceedings of the 7th international conference on Internet and Network Economics
Revenue maximizing envy-free multi-unit auctions with budgets
Proceedings of the 13th ACM Conference on Electronic Commerce
Approximating optimal combinatorial auctions for complements using restricted welfare maximization
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
New formulations and valid inequalities for a bilevel pricing problem
Operations Research Letters
Optimal bundle pricing with monotonicity constraint
Operations Research Letters
Envy-Free Makespan Approximation
SIAM Journal on Computing
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
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
Proceedings of the sixth ACM international conference on Web search and data mining
A co-dependent value-based mechanism for the internet advertisement auction
PRIMA'11 Proceedings of the 14th international conference on Agent Based Simulation for a Sustainable Society and Multi-agent Smart Computing
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.00 |
We study the problem of pricing items for sale to consumers so as to maximize the seller's revenue. We assume that for each consumer, we know the maximum amount he would be willing to pay for each bundle of items, and want to find pricings of the items with corresponding allocations that maximize seller profit and at the same time are envy-free, which is a natural fairness criterion requiring that consumers are maximally happy with the outcome they receive given the pricing. We study this problem for two important classes of inputs: unit demand consumers, who want to buy at most one item from among a selection they are interested in, and single-minded consumers, who want to buy one particular subset, but only if they can afford it.We show that computing envy-free prices to maximize the seller's revenue is APX-hard in both of these cases, and give a logarithmic approximation algorithm for them. For several interesting special cases, we derive polynomial-time algorithms. Furthermore, we investigate some connections with the corresponding mechanism design problem, in which the consumer's preferences are private values: for this case, we give a log-competitive truthful mechanism.