Buying Cheap Is Expensive: Approximability of Combinatorial Pricing Problems

DOI10.1137/090752353zbMath1235.68074OpenAlexW1964207488MaRDI QIDQ3225164

Patrick Briest, Piotr Krysta

Publication date: 15 March 2012

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/090752353

zbMATH Keywords

approximation algorithmshardness of approximationcombinatorial pricing

Mathematics Subject Classification ID

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 (5)

Envy-Free Pricing in Large Markets: Approximating Revenue and Welfare ⋮ Product line optimization with multiples sites ⋮ Pricing to Maximize Revenue and Welfare Simultaneously in Large Markets ⋮ The rank pricing problem with ties ⋮ Assortment optimisation under a general discrete choice model: a tight analysis of revenue-ordered assortments

This page was built for publication: Buying Cheap Is Expensive: Approximability of Combinatorial Pricing Problems