Learning Optimal Posted Prices for a Unit-Demand Buyer
This work addresses a fundamental problem in algorithmic pricing for a unit-demand buyer, offering precise complexity bounds that are incremental improvements over prior results.
The paper tackles the problem of learning optimal item pricing for a unit-demand buyer with independent item values, providing nearly tight sample and pricing query complexities for two query models.
We study the problem of learning the optimal item pricing for a unit-demand buyer with independent item values, and the learner has query access to the buyer's value distributions. We consider two common query models in the literature: the sample access model where the learner can obtain a sample of each item value, and the pricing query model where the learner can set a price for an item and obtain a binary signal on whether the sampled value of the item is greater than our proposed price. In this work, we give nearly tight sample complexity and pricing query complexity of the unit-demand pricing problem.