Fetching the paper…
Reading the bibliography…
We consider a ubiquitous scenario in the Internet economy when individual decision-makers (henceforth, agents) both produce and consume information as they make strategic choices in an uncertain environment.
Introduction to multi-armed bandits
Aleksandrs Slivkins · 1904
Earlier work this paper cites.
Bandit processes and dynamic allocation indices (with discussion)
J. C. Gittins · 1979
Earlier work this paper cites.
Asymptotically efficient Adaptive Allocation Rules
Tze Leung Lai and Herbert Robbins · 1985
Earlier work this paper cites.
On the value of private information in an auction: ignorance may be bliss
Richard Engelbrecht-Wiggans · 1986
Earlier work this paper cites.
Multi-Armed Bandit Allocation Indices
John Gittins, Kevin Glazebrook, and Richard Weber · 1989
Earlier work this paper cites.
The nonstochastic multiarmed bandit problem
Peter Auer, Nicolò Cesa-Bianchi, Yoav Freund, and Robert E. Schapire · 1995
Earlier work this paper cites.
The Theory of Learning in Games
Drew Fudenberg and David K. Levine · 1998
Earlier work this paper cites.
The value of ignorance
Anke Kessler · 1998
Earlier work this paper cites.
Strategic Experimentation
Patrick Bolton and Christopher Harris · 1999
Earlier work this paper cites.
Experimentation in markets
Dirk Bergemann and Juuso Välimäki · 2000
Earlier work this paper cites.
Mark Sellke and Aleksandrs Slivkins · 2002
Earlier work this paper cites.
Price dispersion and learning in a dynamic differentiated-goods duopoly
Godfrey Keller and Sven Rady · 2003
Earlier work this paper cites.
The value of knowing a demand curve: Bounds on regret for online posted-price auctions
Robert D. Kleinberg and Frank T. Leighton · 2003
Earlier work this paper cites.
The dynamic pivot mechanism
Dirk Bergemann and Juuso Välimäki · 2006
Earlier work this paper cites.
Competing bandits: The perils of exploration under competition., 2020
Guy Aridor, Yishay Mansour, Aleksandrs Slivkins, and Steven Wu · 2007
Earlier work this paper cites.
An efficient dynamic mechanism
Susan Athey and Ilya Segal · 2007
Earlier work this paper cites.
Characterizing truthful multi-armed bandit mechanisms
Moshe Babaioff, Yogeshwer Sharma, and Aleksandrs Slivkins · 2009
Earlier work this paper cites.
Dynamic pricing without knowing the demand function: Risk bounds and near-optimal algorithms
Omar Besbes and Assaf Zeevi · 2009
Cited alongside, same era.
The price of truthfulness for pay-per-click auctions
Nikhil Devanur and Sham M. Kakade · 2009
Cited alongside, same era.
Bayesian Persuasion
Emir Kamenica and Matthew Gentzkow · 2011
Cited alongside, same era.
Dynamic pricing with limited supply
Moshe Babaioff, Shaddin Dughmi, Robert D. Kleinberg, and Aleksandrs Slivkins · 2012
Cited alongside, same era.
Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems
Sébastien Bubeck and Nicolo Cesa-Bianchi · 2012
Cited alongside, same era.
Truthful mechanisms with implicit payment computation
Moshe Babaioff, Robert Kleinberg, and Aleksandrs Slivkins · 2013
Bayesian incentive-compatible bandit exploration
Yishay Mansour, Aleksandrs Slivkins, and Vasilis Syrgkanis · 2015
Later among the works it cites.
Bayesian incentive-compatible bandit exploration
Yishay Mansour, Aleksandrs Slivkins, and Vasilis Syrgkanis · 2015
Later among the works it cites.
Information asymmetries in common-value auctions with discrete signals
Vasilis Syrgkanis, David Kempe, and Eva Tardos · 2015
Later among the works it cites.
Economic recommendation systems
Gal Bahar, Rann Smorodinsky, and Moshe Tennenholtz · 2016
Closest in time.
Algorithmic bayesian persuasion
Shaddin Dughmi and Haifeng Xu · 2016
Closest in time.
Learning in social networks
Benjamin Golub and Evan D. Sadler · 2016
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Robust predictions in games with incomplete information
Dirk Bergemann and Stephen Morris · 2013
Cited alongside, same era.
Recommender systems as mechanisms for social learning
Yeon-Koo Che and Johannes Hörner · 2013
Cited alongside, same era.
Learning and incentives in user-generated content: multi-armed bandits with endogenous arms
Arpita Ghosh and Patrick Hummel · 2013
Cited alongside, same era.
Optimal dynamic mechanism design and the virtual-pivot mechanism
Sham M. Kakade, Ilan Lobel, and Hamid Nazerzadeh · 2013
Cited alongside, same era.
Implementing the “wisdom of the crowd”
Ilan Kremer, Yishay Mansour, and Motty Perry · 2013
Cited alongside, same era.
Truthful incentives in crowdsourcing tasks using regret minimization mechanisms
Adish Singla and Andreas Krause · 2013
Cited alongside, same era.
Yishay Mansour, Aleksandrs Slivkins, Vasilis Syrgkanis, and Zhiwei Steven Wu · 2016
Closest in time.
Learning, experimentation, and information design
Johannes Hörner and Andrzej Skrzypacz · 2017
Closest in time.
Crowdsourcing exploration
Kostas Bimpikis, Yiangos Papanastasiou, and Nicos Savva · 2018
Closest in time.
Bandit Algorithms
Tor Lattimore and Csaba Szepesvári · 2018
Closest in time.
Social learning and the innkeeper’s challenge
Gal Bahar, Rann Smorodinsky, and Moshe Tennenholtz · 2019
Closest in time.
Information design: A unified perspective
Dirk Bergemann and Stephen Morris · 2019
Closest in time.
Bayesian exploration with heterogenous agents
Nicole Immorlica, Jieming Mao, Aleksandrs Slivkins, and Steven Wu · 2019
Closest in time.
Bayesian persuasion and information design
Emir Kamenica · 2019
Closest in time.
Incentivizing exploration with selective data disclosure
Nicole Immorlica, Jieming Mao, Aleksandrs Slivkins, and Steven Wu · 2020
Closest in time.
Incentives and exploration in reinforcement learning, 2021
Max Simchowitz and Aleksandrs Slivkins · 2021
Closest in time.