Improved Hardness Results for Profit Maximization Pricing Problems with Unlimited Supply

DOI10.1007/978-3-642-32512-0_7zbMath1358.91073OpenAlexW41321723MaRDI QIDQ3167386

Sanjeev Khanna, Sampath Kannan, Parinya Chalermsook, Julia Chuzhoy

Publication date: 2 November 2012

Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-32512-0_7

Mathematics Subject Classification ID

Consumer behavior, demand theory (91B42) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items

Graph pricing with limited supply ⋮ Envy-Free Pricing in Large Markets: Approximating Revenue and Welfare ⋮ Offline and online algorithms for single-minded selling problem ⋮ On envy-free perfect matching ⋮ Unnamed Item ⋮ An LP-rounding \(2\sqrt{2}\)-approximation for restricted maximum acyclic subgraph ⋮ Approximating the revenue maximization problem with sharp demands ⋮ 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 ⋮ Online pricing for multi-type of items ⋮ Unnamed Item ⋮ On envy-free revenue approximation for combinatorial buyers with budgets ⋮ Pricing on Paths: A PTAS for the Highway Problem ⋮ On fair price discrimination in multi-unit markets ⋮ Assortment optimisation under a general discrete choice model: a tight analysis of revenue-ordered assortments ⋮ Nearly Optimal NP-Hardness of Unique Coverage