Buying cheap is expensive: hardness of non-parametric multi-product pricing

zbMATH Open1303.91078MaRDI QIDQ2934658FDOQ2934658

Authors: Patrick Briest, Piotr Krysta 

Publication date: 18 December 2014

Recommendations

• Buying cheap is expensive: approximability of combinatorial pricing problems
• Uniform Budgets and the Envy-Free Pricing Problem
• Improved hardness results for profit maximization pricing problems with unlimited supply
• Approximation algorithms for the max-buying problem with limited supply
• A Nonparametric Approach to Multiproduct Pricing

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Microeconomic theory (price theory and economic markets) (91B24)

Cited In (15)

• The rank pricing problem: models and branch-and-cut algorithms
• On the complexity of the highway problem
• The envy-free pricing problem, unit-demand markets and connections with the network pricing problem
• Extreme value theorems for optimal multidimensional pricing
• Buying cheap is expensive: approximability of combinatorial pricing problems
• A Nonparametric Approach to Multiproduct Pricing
• Approximation algorithms for the max-buying problem with limited supply
• Approximation algorithms for the max-buying problem with limited supply
• Approximation algorithms for product framing and pricing
• Offline and online algorithms for single-minded selling problem
• On Stackelberg pricing with computationally bounded customers
• Online pricing for bundles of multiple items
• Mixed-integer formulations for the capacitated rank pricing problem with envy
• Pricing commodities
• Stackelberg network pricing games

This page was built for publication: Buying cheap is expensive: hardness of non-parametric multi-product pricing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2934658)