Learning epsilon-optimal posted prices for a unit-demand buyer with independent values takes Theta-tilde(n/epsilon^2) samples, and O-tilde(n^2/epsilon^3) pricing queries suffice, with a matching ex-ante lower bound.
How much data is sufficient to learn high-performing algorithms? generalization guarantees for data-driven algorithm design
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
method 1
citation-polarity summary
fields
cs.GT 1years
2025 1verdicts
CONDITIONAL 1roles
method 1polarities
use method 1representative citing papers
citing papers explorer
-
Learning Optimal Posted Prices for a Unit-Demand Buyer
Learning epsilon-optimal posted prices for a unit-demand buyer with independent values takes Theta-tilde(n/epsilon^2) samples, and O-tilde(n^2/epsilon^3) pricing queries suffice, with a matching ex-ante lower bound.