Abstract
Motivated by posted price auctions where buyers are grouped in an unknown number of latent types characterized by their private values for the good on sale, we investigate regret minimization in stochastic dynamic pricing when the distribution of buyers’ private values is supported on an unknown set of points in [0, 1] of unknown cardinality K.
| Original language | English |
|---|---|
| Pages (from-to) | 247-273 |
| Number of pages | 27 |
| Journal | Proceedings of Machine Learning Research |
| Volume | 98 |
| Publication status | Published - 1 Jan 2019 |
| Externally published | Yes |
| Event | 30th International Conference on Algorithmic Learning Theory, ALT 2019 - Chicago, United States Duration: 22 Mar 2019 → 24 Mar 2019 |
Keywords
- Posted price auction
- dynamic pricing
- multiarmed bandits
- regret minimization