- Adish Singla and Andreas Krause. Truthful incentives in crowdsourcing tasks using regret minimization mechanisms. In 22nd Intl. World Wide Web Conf. (WWW), pages 1167–1178, 2013.
Paper not yet in RePEc: Add citation now
- Alberto Bietti, Alekh Agarwal, and John Langford. A contextual bandit bake-off. CoRR arXiv:1802.04064, 2018.
Paper not yet in RePEc: Add citation now
- Alekh Agarwal, Sarah Bird, Markus Cozowicz, Luong Hoang, John Langford, Stephen Lee, Jiaji Li, Dan Melamed, Gal Oshri, Oswaldo Ribas, Siddhartha Sen, and Alex Slivkins. Making contextual decisions with low technical debt, 2017. Techical report at arxiv.org/abs/1606.03966.
Paper not yet in RePEc: Add citation now
- Aleksandrs Slivkins and Eli Upfal. Adapting to a changing environment: the Brownian restless bandits. In 21st Conf. on Learning Theory (COLT), pages 343–354, 2008.
Paper not yet in RePEc: Add citation now
- Aleksandrs Slivkins. Introduction to multi-armed bandits. Foundations and Trendsr in Machine Learning, 12(1-2):1–286, November 2019. Published with Now Publishers (Boston, MA, USA). Also available at https://arxiv.org/abs/1904.07272.
Paper not yet in RePEc: Add citation now
Alexandre De Corniere and Greg Taylor. Data and competition: a general framework with applications to mergers, market structure, and privacy policy. 2020.
Andre Veiga and Glen Weyl. Product design in selection markets. Quarterly J. of Economics, 131(2): 1007–1056, 2016.
- Anja Lambrecht and Catherine E Tucker. Can big data protect a firm from competition? 2015.
Paper not yet in RePEc: Add citation now
- Arpita Ghosh and Patrick Hummel. Learning and incentives in user-generated content: multi-armed bandits with endogenous arms. In Innovations in Theoretical Computer Science Conf. (ITCS), pages 233–246, 2013.
Paper not yet in RePEc: Add citation now
- Bruno Jullien and Wilfried Sand-Zantman. The economics of platforms: A theory guide for competition policy. TSE Digital Center Policy Papers series, (1), 2019.
Paper not yet in RePEc: Add citation now
- Chien-Ju Ho, Aleksandrs Slivkins, and Jennifer Wortman Vaughan. Adaptive contract design for crowdsourcing markets: Bandit algorithms for repeated principal-agent problems. J. of Artificial Intelligence Research, 55:317–359, 2016. Preliminary version appeared in ACM EC 2014.
Paper not yet in RePEc: Add citation now
Daniel Russo and Benjamin Van Roy. Learning to optimize via posterior sampling. Mathematics of Operations Research, 39(4):1221–1243, 2014.
- Daniel Russo, Benjamin Van Roy, Abbas Kazerouni, Ian Osband, and Zheng Wen. A tutorial on thompson sampling. Foundations and Trends in Machine Learning, 11(1):1–96, 2018. Published with Now Publishers (Boston, MA, USA). Also available at https://arxiv.org/abs/1707.02038.
Paper not yet in RePEc: Add citation now
Dirk Bergemann and Juuso Välimäki. The dynamic pivot mechanism. Econometrica, 78(2):771–789, 2010.
Drew Fudenberg and Jean Tirole. Learning-by-doing and market performance. The Bell Journal of Economics, pages 522–530, 1983.
Eduardo Azevedo and Daniel Gottlieb. Perfect competition in markets with adverse selection. Econometrica, 85(1):67–105, 2017.
- Emilie Kaufmann, Nathaniel Korda, and ReÃŒÂmi Munos. Thompson sampling: An asymptotically optimal finite-time analysis. In 23rd Intl. Conf. on Algorithmic Learning Theory (ALT), pages 199–213, 2012. Godfrey Keller, Sven Rady, and Martin Cripps. Strategic Experimentation with Exponential Bandits.
Paper not yet in RePEc: Add citation now
- Eyal Even-Dar, Shie Mannor, and Yishay Mansour. Action elimination and stopping conditions for the multi-armed bandit and reinforcement learning problems. J. of Machine Learning Research (JMLR), 7: 1079–1105, 2006.
Paper not yet in RePEc: Add citation now
- Fiona Scott Morton, Pascal Bouvier, Ariel Ezrachi, Bruno Jullien, Roberta Katz, Gene Kimmelman, A Douglas Melamed, and Jamie Morgenstern. Committee for the study of digital platforms: Market structure and antitrust subcommittee report. Chicago: Stigler Center for the Study of the Economy and the State, University of Chicago Booth School of Business, 2019.
Paper not yet in RePEc: Add citation now
- Gal Bahar, Rann Smorodinsky, and Moshe Tennenholtz. Economic recommendation systems. In 16th ACM Conf. on Electronic Commerce (ACM-EC), 2016.
Paper not yet in RePEc: Add citation now
Glen Weyl and Alexander White. Let the right fione’ win: Policy lessons from the new economics of platforms. Competition Policy International, 12(2):29–51, 2014.
- Guy Aridor, Kevin Liu, Aleksandrs Slivkins, and Steven Wu. The perils of exploration under competition: A computational modeling approach. In 20th ACM Conf. on Economics and Computation (ACM-EC), 2019.
Paper not yet in RePEc: Add citation now
Hal Varian. Artificial intelligence, economics, and industrial organization. In The Economics of Artificial Intelligence: An Agenda. University of Chicago Press, 2018.
- Hamsa Bastani, Mohsen Bayati, and Khashayar Khosravi. Mostly exploration-free algorithms for contextual bandits. CoRR arXiv:1704.09011, 2018. Working paper.
Paper not yet in RePEc: Add citation now
- Harold Hotelling. Stability in competition. The Economic Journal, 39(153):41–57, 1929.
Paper not yet in RePEc: Add citation now
- Ilan Kremer, Yishay Mansour, and Motty Perry. Implementing the “wisdom of the crowdâ€Â. J. of Political Economy, 122(5):988–1012, 2014. Preliminary version in ACM EC 2013.
Paper not yet in RePEc: Add citation now
- In 13th ACM Conf. on Electronic Commerce (ACM-EC), 2012. Andrei Hagiu and Julian Wright. Data-enabled learning, network effects and competitive advantage.
Paper not yet in RePEc: Add citation now
- Jason Furman, Diane Coyle, Amelia Fletcher, Derek McAuley, and Philip Marsden. Unlocking digital competition. Report of the digital competition expert panel, 2019.
Paper not yet in RePEc: Add citation now
Jean Tirole. The theory of industrial organization. MIT press, 1988.
Jeffrey M. Perloff and Steven C. Salop. Equilibrium with product differentiation. Review of Economic Studies, LII:107–120, 1985.
Jens Prufer and Christoph Schottmüller. Competing with big data. 2017.
- John Gittins, Kevin Glazebrook, and Richard Weber. Multi-Armed Bandit Allocation Indices. John Wiley & Sons, Hoboken, NJ, USA, 2nd edition, 2011. The first edition, single-authored by John Gittins, has been published in 1989. Ramakrishna Gummadi, Ramesh Johari, and Jia Yuan Yu. Mean field equilibria of multiarmed bandit games.
Paper not yet in RePEc: Add citation now
- Kostas Bimpikis, Yiangos Papanastasiou, and Nicos Savva. Crowdsourcing exploration. Management Science, 64(4):1477–1973, 2018.
Paper not yet in RePEc: Add citation now
Kyle Bagwell. Informational product differentiation as a barrier to entry. International Journal of Industrial Organization, 8(2):207–223, 1990.
- Machine Learning, 47(2-3):235–256, 2002a.
Paper not yet in RePEc: Add citation now
- Manish Raghavan, Aleksandrs Slivkins, Jennifer Wortman Vaughan, and Zhiwei Steven Wu. The externalities of exploration and how data diversity helps exploitation. In Conf. on Learning Theory (COLT), pages 1724–1738, 2018.
Paper not yet in RePEc: Add citation now
Marc Rysman. The economics of two-sided markets. J. of Economic Perspectives, 23(3):125–144, 2009.
- Mark Sellke and Aleksandrs Slivkins. Sample complexity of insentivized exploration, 2020. Working paper, available at https://arxiv.org/abs/2002.00558.
Paper not yet in RePEc: Add citation now
- Michael Mitzenmacher and Eli Upfal. Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, Cambridge, UK, 2005.
Paper not yet in RePEc: Add citation now
Michael Rothschild and Joseph Stiglitz. Equilibrium in competitive insurance markets: An essay on the economics of imperfect information. Quarterly J. of Economics, 90(4):629–649, 1976.
- Moshe Babaioff, Robert Kleinberg, and Aleksandrs Slivkins. Truthful mechanisms with implicit payment computation. J. of the ACM, 62(2):10, 2015. Subsumes conference papers in ACM EC 2010 and ACM EC 2013.
Paper not yet in RePEc: Add citation now
- Moshe Babaioff, Yogeshwer Sharma, and Aleksandrs Slivkins. Characterizing truthful multi-armed bandit mechanisms. SIAM J. on Computing (SICOMP), 43(1):194–230, 2014. Preliminary version in 10th ACM EC, 2009.
Paper not yet in RePEc: Add citation now
- Nicole Immorlica, Adam Tauman Kalai, Brendan Lucier, Ankur Moitra, Andrew Postlewaite, and Moshe Tennenholtz. Dueling algorithms. In 43rd ACM Symp. on Theory of Computing (STOC), pages 215–224, 2011.
Paper not yet in RePEc: Add citation now
- Nicole Immorlica, Jieming Mao, Aleksandrs Slivkins, and Steven Wu. Incentivizing exploration with selective data disclosure. In ACM Conf. on Economics and Computation (ACM-EC), 2020. Working paper available at https://arxiv.org/abs/1811.06026.
Paper not yet in RePEc: Add citation now
- Nicolò Cesa-Bianchi and GaÃŒÂbor Lugosi. Prediction, learning, and games. Cambridge University Press, Cambridge, UK, 2006.
Paper not yet in RePEc: Add citation now
- Nikhil Devanur and Sham M. Kakade. The price of truthfulness for pay-per-click auctions. In 10th ACM Conf. on Electronic Commerce (ACM-EC), pages 99–106, 2009.
Paper not yet in RePEc: Add citation now
- Omer Ben-Porat and Moshe Tennenholtz. Best response regression. In Advances in Neural Information Processing Systems, pages 1499–1508, 2017.
Paper not yet in RePEc: Add citation now
- Omer Ben-Porat and Moshe Tennenholtz. Regression equilibrium. In Proceedings of the 2019 ACM Conference on Economics and Computation, pages 173–191, 2019.
Paper not yet in RePEc: Add citation now
- on Artificial Intelligence and Statistics (AISTATS), pages 99–107, 2013.
Paper not yet in RePEc: Add citation now
Patrick Bajari, Victor Chernozhukov, Ali Hortaçsu, and Junichi Suzuki. The impact of big data on firm performance: An empirical investigation. Technical report, National Bureau of Economic Research, 2018.
Patrick Bolton and Christopher Harris. Strategic Experimentation. Econometrica, 67(2):349–374, 1999.
Paul Milgrom and Nancy Stokey. Information, trade and common knowledge. J. of Economic Theory, 26(1): 17–27, 1982.
- Peter Auer, Nicolò Cesa-Bianchi, Yoav Freund, and Robert E. Schapire. The nonstochastic multiarmed bandit problem. SIAM J. Comput., 32(1):48–77, 2002b. Preliminary version in 36th IEEE FOCS, 1995.
Paper not yet in RePEc: Add citation now
- Peter Frazier, David Kempe, Jon M. Kleinberg, and Robert Kleinberg. Incentivizing exploration. In ACM Conf. on Economics and Computation (ACM-EC), pages 5–22, 2014.
Paper not yet in RePEc: Add citation now
Philippe Aghion, Nick Bloom, Richard Blundell, Rachel Griffith, and Peter Howitt. Competition and innovation: An inverted-u relationship. The Quarterly Journal of Economics, 120(2):701–728, 2005.
- Preliminary versions have been available since 2006.
Paper not yet in RePEc: Add citation now
Richard Schmalensee. Product differentiation advantages of pioneering brands. The American Economic Review, 72(3):349–365, 1982.
Robert D. Kleinberg, Bo Waggoner, and E. Glen Weyl. Descending price optimally coordinates search. In 17th ACM Conf. on Economics and Computation (ACM-EC), pages 23–24, 2016.
- Roger A Kerin, P Rajan Varadarajan, and Robert A Peterson. First-mover advantage: A synthesis, conceptual framework, and research propositions. The Journal of Marketing, pages 33–52, 1992.
Paper not yet in RePEc: Add citation now
- Sampath Kannan, Jamie Morgenstern, Aaron Roth, Bo Waggoner, and Zhiwei Steven Wu. A smoothed analysis of the greedy algorithm for the linear contextual bandit problem. In Advances in Neural Information Processing Systems (NIPS), 2018.
Paper not yet in RePEc: Add citation now
- SeÃŒÂbastien Bubeck and Nicolo Cesa-Bianchi. Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems. Foundations and Trends in Machine Learning, 5(1):1–122, 2012. Published with Now Publishers (Boston, MA, USA). Also available at https://arxiv.org/abs/1204.5721. Luis MB Cabral and Michael H Riordan. The learning curve, market dominance, and predatory pricing.
Paper not yet in RePEc: Add citation now
Sham M. Kakade, Ilan Lobel, and Hamid Nazerzadeh. Optimal dynamic mechanism design and the virtualpivot mechanism. Operations Research, 61(4):837–854, 2013.
- Shipra Agrawal and Navin Goyal. Analysis of Thompson Sampling for the multi-armed bandit problem. In 25nd Conf. on Learning Theory (COLT), 2012. Shipra Agrawal and Navin Goyal. Further optimal regret bounds for thompson sampling. In 16th Intl. Conf.
Paper not yet in RePEc: Add citation now
Susan Athey and Ilya Segal. An efficient dynamic mechanism. Econometrica, 81(6):2463–2485, November 2013. A preliminary version has been available as a working paper since 2007. Peter Auer, Nicolò Cesa-Bianchi, and Paul Fischer. Finite-time analysis of the multiarmed bandit problem.
- Tor Lattimore and Csaba SzepesvaÃŒÂri. Bandit Algorithms. Cambridge University Press, Cambridge, UK, 2020.
Paper not yet in RePEc: Add citation now
- Tze Leung Lai and Herbert Robbins. Asymptotically efficient Adaptive Allocation Rules. Advances in Applied Mathematics, 6:4–22, 1985.
Paper not yet in RePEc: Add citation now
- Versions available at https://banditalgs.com/ since 2018.
Paper not yet in RePEc: Add citation now
- William R. Thompson. On the likelihood that one unknown probability exceeds another in view of the evidence of two samples. Biometrika, 25(3-4):285–294, 1933.
Paper not yet in RePEc: Add citation now
Xavier Gabaix, David Laibson, Deyuan Li, Hongyi Li, Sidney Resnick, and Casper G. de Vries. The impact of competition on prices with numerous firms. J. of Economic Theory, 165:1–24, 2016.
Xavier Vives. Innovation and competitive pressure. J. of Industrial Economics, 56(3), 2008.
Yeon-Koo Che and Johannes Hörner. Recommender systems as mechanisms for social learning. Quarterly Journal of Economics, 133(2):871fi?!925, 2018. Working paper since 2013, titled ’Optimal design for social learning’. Partha Dasgupta and Joseph Stiglitz. Learning-by-doing, market structure and industrial and trade policies.
- Yishay Mansour, Aleksandrs Slivkins, and Steven Wu. Competing bandits: Learning under competition. In 9th Innovations in Theoretical Computer Science Conf. (ITCS), 2018. Yishay Mansour, Aleksandrs Slivkins, and Vasilis Syrgkanis. Bayesian incentive-compatible bandit exploration.
Paper not yet in RePEc: Add citation now
- Yishay Mansour, Aleksandrs Slivkins, Vasilis Syrgkanis, and Steven Wu. Bayesian exploration: Incentivizing exploration in Bayesian games, 2016. Working paper (2016-2018). Avalable at https://arxiv.org/abs/1602.07570. Prelimiary version in ACM EC 2016. Revise and resubmit in Operations Research.
Paper not yet in RePEc: Add citation now
- Yisong Yue and Thorsten Joachims. Interactively optimizing information retrieval systems as a dueling bandits problem. In 26th Intl. Conf. on Machine Learning (ICML), pages 1201–1208, 2009.
Paper not yet in RePEc: Add citation now
- Yisong Yue, Josef Broder, Robert Kleinberg, and Thorsten Joachims. The k-armed dueling bandits problem. J. Comput. Syst. Sci., 78(5):1538–1556, 2012. Preliminary version in COLT 2009.
Paper not yet in RePEc: Add citation now