1. Competing in the dark: An efficient algorithm for bandit linear optimization;Jacob Abernethy;21st Annual Conference on Learning Theory,2008
2. Blackwell approachability and no-regret learning are equivalent;Jacob Abernethy;Proceedings of the 24th Annual Conference on Learning Theory,2011
3. Mnl-bandit: A dynamic learning approach to assortment selection;Shipra Agrawal;Operations Research,2019
4. Maximizing a class of submodular utility functions;Shabbir Ahmed;Mathematical programming,2011
5. Optimal auctions vs. anonymous pricing;Saeed Alaei;Games and Economic Behavior,2019