Fetching the paper…
Reading the bibliography…
When an Agent visits a platform recommending a menu of content to select from, their choice of item depends not only on fixed preferences, but also on their prior engagements with the platform.
On bounded polynomials in several variables
O. D. Kellogg · 1928
Earlier work this paper cites.
Polynomial interpolation in several variables
Mariano Gasca and Thomas Sauer · 2000
Earlier work this paper cites.
Online convex optimization in the bandit setting: gradient descent without a gradient
Abraham Flaxman, Adam Tauman Kalai, and H. Brendan McMahan · 2004
Earlier work this paper cites.
Interactively optimizing information retrieval systems as a dueling bandits problem
Yisong Yue and Thorsten Joachims · 2009
Earlier work this paper cites.
The k-armed dueling bandits problem
Yisong Yue, Josef Broder, Robert Kleinberg, and Thorsten Joachims · 2011
Earlier work this paper cites.
Interior-point methods for full-information and bandit online learning
Jacob D. Abernethy, Elad Hazan, and Alexander Rakhlin · 2012
Earlier work this paper cites.
Learning in auctions: Regret is hard, envy is easy
Constantinos Daskalakis and Vasilis Syrgkanis · 2015
Earlier work this paper cites.
Down the (white) rabbit hole: The extreme right and online recommender systems
Derek O’Callaghan, Derek Greene, Maura Conway, Joe Carthy, and Pádraig Cunningham · 2015
Earlier work this paper cites.
A robust sparse fourier transform in the continuous setting
Eric Price and Zhao Song · 2015
Earlier work this paper cites.
Watch and learn: Optimizing from revealed preferences feedback
Aaron Roth, Jonathan R. Ullman, and Zhiwei Steven Wu · 2015
Earlier work this paper cites.
Deconvolving feedback loops in recommender systems
Ayan Sinha, David F. Gleich, and Karthik Ramani · 2016
Earlier work this paper cites.
Learning with limited rounds of adaptivity: Coin tossing, multi-armed bandits, and ranking from pairwise comparisons
Arpit Agarwal, Shivani Agarwal, Sepehr Assadi, and Sanjeev Khanna · 2017
Cited alongside, same era.
Mark Braverman, Jieming Mao, Jon Schneider, and S. Matthew Weinberg · 2017
Cited alongside, same era.
How algorithmic confounding in recommendation systems increases homogeneity and decreases utility
Allison J. B. Chaney, Brandon M. Stewart, and Barbara E. Engelhardt · 2017
Cited alongside, same era.
Strategic classification from revealed preferences
Jinshuo Dong, Aaron Roth, Zachary Schutzman, Bo Waggoner, and Zhiwei Steven Wu · 2017
Cited alongside, same era.
Online learning over a finite action set with limited switching
Understanding echo chambers in e-commerce recommender systems
Yingqiang Ge, Shuya Zhao, Honglu Zhou, Changhua Pei, Fei Sun, Wenwu Ou, and Yongfeng Zhang · 2020
Later among the works it cites.
Feedback loop and bias amplification in recommender systems
Masoud Mansoury, Himan Abdollahpouri, Mykola Pechenizkiy, Bamshad Mobasher, and Robin Burke · 2020
Later among the works it cites.
Stochastic optimization for performative prediction
Celestine Mendler-Dünner, Juan Perdomo, Tijana Zrnic, and Moritz Hardt · 2020
Later among the works it cites.
Optimizing long-term social welfare in recommender systems: A constrained matching approach
Martin Mladenov, Elliot Creager, Omer Ben-Porat, Kevin Swersky, Richard S. Zemel, and Craig Boutilier · 2020
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Jason Altschuler and Kunal Talwar · 2018
Cited alongside, same era.
Preference-based online learning with dueling bandits: A survey
Róbert Busa-Fekete, Eyke Hüllermeier, and Adil El Mesaoudi-Paul · 2018
Cited alongside, same era.
Strategizing against no-regret learners
Yuan Deng, Jon Schneider, and Balasubramanian Sivan · 2019
Cited alongside, same era.
Trust and trustworthiness in social recommender systems
Taha Hassan · 2019
Cited alongside, same era.
Introduction to online convex optimization
Elad Hazan · 2019
Cited alongside, same era.
Choice bandits
Arpit Agarwal, Nicholas Johnson, and Shivani Agarwal · 2020
Cited alongside, same era.
Chasing Nested Convex Bodies Nearly Optimally
Sébastien Bubeck, Bo’az Klartag, Yin Tat Lee, Yuanzhi Li, and Mark Sellke · 2020
Cited alongside, same era.
Juan C. Perdomo, Tijana Zrnic, Celestine Mendler-Dünner, and Moritz Hardt · 2020
Later among the works it cites.
Sequential choice bandits with feedback for personalizing users’ experience, 2021
Anshuka Rangi, Massimo Franceschetti, and Long Tran-Thanh · 2021
Later among the works it cites.
Rabbit holes and taste distortion: Distribution-aware recommendation with evolving interests
Xing Zhao, Ziwei Zhu, and James Caverlee · 2021
Later among the works it cites.
Who leads and who follows in strategic classification?
Tijana Zrnic, Eric V. Mazumdar, S. Shankar Sastry, and Michael I. Jordan · 2021
Later among the works it cites.
Emergent instabilities in algorithmic feedback loops
Keith Burghardt and Kristina Lerman · 2022
Closest in time.
Regret minimization with performative feedback
Meena Jagadeesan, Tijana Zrnic, and Celestine Mendler-Dünner · 2022
Closest in time.