The Complexity of Optimal Multidimensional Pricing
Abstract
We resolve the complexity of revenue-optimal deterministic auctions in the unit-demand single-buyer Bayesian setting, i.e., the optimal item pricing problem, when the buyer's values for the items are independent. We show that the problem of computing a revenue-optimal pricing can be solved in polynomial time for distributions of support size 2, and its decision version is NP-complete for distributions of support size 3. We also show that the problem remains NP-complete for the case of identical distributions.
- Publication:
-
arXiv e-prints
- Pub Date:
- November 2013
- DOI:
- 10.48550/arXiv.1311.2138
- arXiv:
- arXiv:1311.2138
- Bibcode:
- 2013arXiv1311.2138C
- Keywords:
-
- Computer Science - Computer Science and Game Theory;
- Computer Science - Computational Complexity