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