Bar-Yossef, Z., Hildrum, K., and Wu, F. (2002). Incentive-compatible online auctions for digital goods. In Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 964-970.
Besbes, O. and Zeevi, A. (2009). Dynamic pricing without knowing the demand function: Risk bounds and near-optimal algorithms. Operations Research, 57(6):1407-1420.
Besbes, O. and Zeevi, A. (2015). On the surprising sufficiency of linear models for dynamic pricing with demand learning. Management Science, 61(4):723-739.
Broder, J. and Rusmevichientong, P. (2012). Dynamic pricing under a general parametric choice model. Operations Research, 60(4):965-980.
Bubeck, S., Devanur, N. R., Huang, Z., and Niazadeh, R. (2019). Multi-scale online learning: Theory and applications to online auctions and pricing. Journal of Machine Learning Research, 20(62):1-37.
Cai, Y. and Daskalakis, C. (2017). Learning multi-item auctions with (or without) samples. In Proceedings of the Fifty-Eighth Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 516-527.
Cesa-Bianchi, N., Cesari, T., and Perchet, V. (2019). Dynamic pricing with finitely many unknown valuations. In Proceedings of the Thirtieth International Conference on Algorithmic Learning Theory, pages 247-273.
Chen, W., Wang, Y., and Yuan, Y. (2013). Combinatorial multi-armed bandit: General framework and applications. In Proceedings of the Thirtieth International Conference on Machine Learning (ICML), volume 28, pages 151-159.
Chen, Y. and Farias, V. F. (2013). Simple policies for dynamic pricing with imperfect forecasts. Operations Research, 61(3):612-624.
Cohen, M. C., Lobel, I., and Paes Leme, R. (2020). Feature-based dynamic pricing. Management Science, 66(11):4921-4943.
Dani, V., Hayes, T., and Kakade, S. M. (2008). Stochastic linear optimization under bandit feedback. Proceedings of the Twenty-First Annual Conference on Learning Theory (COLT), pages 355-366.
Einav, L., Farronato, C., Levin, J., and Sundaresan, N. (2018). Auctions versus posted prices in online markets. Journal of Political Economy, 126(1):178-215.
Erginbas, Y. E., Phade, S., and Ramchandran, K. (2023). Interactive learning with pricing for optimal and stable allocations in markets. In Proceedings of the Twenty-Sixth International Conference on Artificial Intelligence and Statistics (AISTATS), pages 9773-9806.
Feldman, M., Gravin, N., and Lucier, B. (2015). Combinatorial auctions via posted prices. In Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 123-135.
Ferreira, K. J., Simchi-Levi, D., and Wang, H. (2018). Online network revenue management using thompson sampling. Operations Research, 66(6):1586-1602.
Harrison, J. M., Keskin, N. B., and Zeevi, A. (2012). Bayesian dynamic pricing policies: Learning and earning under a binary prior distribution. Management Science, 58(3):570-586.
Jagadeesan, M., Wei, A., Wang, Y., Jordan, M. I., and Steinhardt, J. (2021). Learning equilibria in matching markets from bandit feedback. Proceedings of Thity-Fifth Conference on Neural Information Processing Systems (NeurIPS), pages 3323-3335.
Johari, R., Kamble, V., and Kanoria, Y. (2017). Matching while learning. In Proceedings of the ACM Conference on Economics and Computation, pages 119-119.
Keskin, N. B. and Zeevi, A. (2014). Dynamic pricing with an unknown demand model: Asymptotically optimal semi-myopic policies. Operations Research, 62:1142-1167.