Publication:2934658
From MaRDI portal
zbMath1303.91078MaRDI QIDQ2934658
Publication date: 18 December 2014
Microeconomic theory (price theory and economic markets) (91B24) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Related Items
Offline and online algorithms for single-minded selling problem, Mixed-integer formulations for the capacitated rank pricing problem with envy, Pricing commodities, Stackelberg network pricing games, The rank pricing problem: models and branch-and-cut algorithms, On stackelberg pricing with computationally bounded customers, The envy-free pricing problem, unit-demand markets and connections with the network pricing problem, Approximation algorithms for the max-buying problem with limited supply, On the complexity of the highway problem, Extreme value theorems for optimal multidimensional pricing, Online pricing for bundles of multiple items