Dynamic pricing with finitely many unknown valuations
From MaRDI portal
Cites work
- Bandits with knapsacks
- Dynamic pricing under a general parametric choice model
- Finite-time analysis of the multiarmed bandit problem
- Near-optimal online auctions
- Noisy binary search and its applications
- Online learning in online auctions
- Perfect Bayesian equilibria in repeated sales
- Prediction, Learning, and Games
- The Nonstochastic Multiarmed Bandit Problem
This page was built for publication: Dynamic pricing with finitely many unknown valuations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7034398)