Integer and combinatorial optimization
Integer and combinatorial optimization
Computationally Manageable Combinational Auctions
Management Science
Truth revelation in approximately efficient combinatorial auctions
Journal of the ACM (JACM)
Competitive Auctions for Multiple Digital Goods
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
On profit-maximizing envy-free pricing
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
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
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
Near-optimal pricing in near-linear time
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Reducing mechanism design to algorithm design via machine learning
Journal of Computer and System Sciences
On Multi-dimensional Envy-Free Mechanisms
ADT '09 Proceedings of the 1st International Conference on Algorithmic Decision Theory
On Profit-Maximizing Pricing for the Highway and Tollbooth Problems
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
Bundle pricing with comparable items
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Envy-free pricing in multi-item markets
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
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
Competitive algorithms for online pricing
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
On the hardness of pricing loss-leaders
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Optimal bundle pricing with monotonicity constraint
Operations Research Letters
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 consider a profit maximization problem where we are asked to price a set of m items that are to be assigned to a set of n customers. The items can be represented as the edges of an undirected (multi)graph G, where an edge multiplicity larger than one corresponds to multiple copies of the same item. Each customer is interested in purchasing a bundle of edges of G, and we assume that each bundle forms a simple path in G. Each customer has a known budget for her respective bundle, and is interested only in that particular bundle. The goal is to determine item prices and a feasible assignment of items to customers in order to maximize the total profit. When the underlying graph G is a path, we derive a fully polynomial time approximation scheme, complementing a recent NP-hardness result. If the underlying graph is a tree, and edge multiplicities are one, we show that the problem is polynomially solvable, contrasting its APX-hardness for the case of unlimited availability of items. However, if the underlying graph is a grid, and edge multiplicities are one, we show that it is even NP-complete to approximate the maximum profit to within a factor n1−−ε.