We consider the unit-demand min-buying pricing problem, in which we want to compute revenue maximizing prices for a set of products P assuming that each consumer from a set of consumer samples C will purchase her cheapest affordable product once prices are fixed. We focus on the special uniform-budget case, in which every consumer has only a single non-zero budget for some set of products. This constitutes a special case also of the unit-demand envy-free pricing problem. We show that, assuming specific hardness of the balanced bipartite independent set problem in constant degree graphs or hardness of refuting random 3CNF formulas, the unit-demand min-buying pricing problem with uniform budgets cannot be approximated in polynomial time within O(log ε |C|) for some ε > 0. This is the first result giving evidence that unit-demand envy-free pricing, as well, might be hard to approximate essentially better than within the known logarithmic ratio. We then introduce a slightly more general problem definition in which consumers are given as an explicit probability distribution and show that in this case the envy-free pricing problem can be shown to be inapproximable within O(|P| ε ) assuming NP T δ>0 BPTIME(2 O(n δ ) ). Finally, we briefly argue that all the results apply to the important setting of pricing with single-minded consumers as well.
Briest REF showed that given appropriate complexity assumptions, the unit-demand envy-free pricing problem in general cannot be approximated within O(log ǫ n) for some ǫ > 0.
Uniform budgets and the envy-free pricing problem
In Proceedings of the 35th International Colloquium on Automata, Languages and Programming
Mathematics Computer Science