Fetching the paper…
Reading the bibliography…
The agency problem emerges in today's large scale machine learning tasks, where the learners are unable to direct content creation or enforce data collection.
On the method of bounded differences
Colin McDiarmid et al · 1989
Earlier work this paper cites.
An analysis of the principal-agent problem
Sanford J Grossman and Oliver D Hart · 1992
Earlier work this paper cites.
The continuum-armed bandit problem
Rajeev Agrawal · 1995
Earlier work this paper cites.
Planning and acting in partially observable stochastic domains
Leslie Pack Kaelbling, Michael L Littman, and Anthony R Cassandra · 1998
Earlier work this paper cites.
The value of knowing a demand curve: Bounds on regret for online posted-price auctions
Robert Kleinberg and Tom Leighton · 2003
Earlier work this paper cites.
Online learning in online auctions
Avrim Blum, Vijay Kumar, Atri Rudra, and Felix Wu · 2004
Earlier work this paper cites.
Contract theory
Stephen A Smith · 2004
Earlier work this paper cites.
The theory of incentives
Jean-Jacques Laffont and David Martimort · 2009
Earlier work this paper cites.
Learning and approximating the optimal strategy to commit to
Joshua Letchford, Vincent Conitzer, and Kamesh Munagala · 2009
Earlier work this paper cites.
Epsilon–first policies for budget–limited multi-armed bandits
Long Tran-Thanh, Archie Chapman, Enrique Munoz De Cote, Alex Rogers, and Nicholas R Jennings · 2010
Earlier work this paper cites.
Improved algorithms for linear stochastic bandits
Yasin Abbasi-Yadkori, Dávid Pál, and Csaba Szepesvári · 2011
Earlier work this paper cites.
Knapsack based optimal policies for budget–limited multi–armed bandits
Long Tran-Thanh, Archie Chapman, Alex Rogers, and Nicholas Jennings · 2012
Earlier work this paper cites.
Bandits with concave rewards and convex knapsacks
Shipra Agrawal and Nikhil R Devanur · 2014
Earlier work this paper cites.
Incentivizing exploration
Peter Frazier, David Kempe, Jon Kleinberg, and Robert Kleinberg · 2014
Earlier work this paper cites.
Commitment without regrets: Online learning in stackelberg security games
Maria-Florina Balcan, Avrim Blum, Nika Haghtalab, and Ariel D Procaccia · 2015
Earlier work this paper cites.
Bayesian incentive-compatible bandit exploration
Yishay Mansour, Aleksandrs Slivkins, and Vasilis Syrgkanis · 2015
Earlier work this paper cites.
Thompson sampling for budgeted multi-armed bandits
Yingce Xia, Haifang Li, Tao Qin, Nenghai Yu, and Tie-Yan Liu · 2015
Earlier work this paper cites.
Linear contextual bandits with knapsacks
Shipra Agrawal and Nikhil Devanur · 2016
Earlier work this paper cites.
Adaptive contract design for crowdsourcing markets: Bandit algorithms for repeated principal-agent problems
Chien-Ju Ho, Aleksandrs Slivkins, and Jennifer Wortman Vaughan · 2016
Earlier work this paper cites.
Budgeted multi-armed bandits with multiple plays
Yingce Xia, Tao Qin, Weidong Ma, Nenghai Yu, and Tie-Yan Liu · 2016
Cited alongside, same era.
Bandits with knapsacks
Ashwinkumar Badanidiyuru, Robert Kleinberg, and Aleksandrs Slivkins · 2018
Cited alongside, same era.
What doubling tricks can and can’t do for multi-armed bandits
Lilian Besson and Emilie Kaufmann · 2018
Cited alongside, same era.
Delegated search approximates efficient search
Jon Kleinberg and Robert Kleinberg · 2018
Cited alongside, same era.
Contextual search via intrinsic volumes
Renato Paes Leme and Jon Schneider · 2018
Cited alongside, same era.
Multidimensional binary search for contextual decision-making
Ilan Lobel, Renato Paes Leme, and Adrian Vladu · 2018
Cited alongside, same era.
The creator economy: Managing ecosystem supply, revenue sharing, and platform design
Hemant K Bhargava · 2022
Later among the works it cites.
Designing menus of contracts efficiently: The power of randomization
Matteo Castiglioni, Alberto Marchesi, and Nicola Gatti · 2022
Later among the works it cites.
The rise of the creator economy
Richard Florida · 2022
Later among the works it cites.
Adversarial bandits with knapsacks
Nicole Immorlica, Karthik Sankararaman, Robert Schapire, and Aleksandrs Slivkins · 2022
Later among the works it cites.
Sequential information design: Markov persuasion process and its efficient reinforcement learning
Jibang Wu, Zixuan Zhang, Zhe Feng, Zhaoran Wang, Zhuoran Yang, Michael I Jordan, and Haifeng Xu · 2022
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Contextual pricing for lipschitz buyers
Jieming Mao, Renato Leme, and Jon Schneider · 2018
Cited alongside, same era.
Incentives in the dark: multi-armed bandits for evolving users with unknown type
Lillian J Ratliff, Shreyas Sekar, Liyuan Zheng, and Tanner Fiez · 2018
Cited alongside, same era.
Reinforcement learning: Theory and algorithms
Alekh Agarwal, Nan Jiang, Sham M Kakade, and Wen Sun · 2019
Cited alongside, same era.
Multi-armed bandit problems with strategic arms
Mark Braverman, Jieming Mao, Jon Schneider, and S Matthew Weinberg · 2019
Cited alongside, same era.
Simple versus optimal contracts
Paul Dütting, Tim Roughgarden, and Inbal Talgam-Cohen · 2019
Cited alongside, same era.
Learning optimal strategies to commit to
Binghui Peng, Weiran Shen, Pingzhong Tang, and Song Zuo · 2019
Cited alongside, same era.
Banghua Zhu, Stephen Bates, Zhuoran Yang, Yixin Wang, Jiantao Jiao, and Michael I Jordan · 2022
Later among the works it cites.
Optimal rates and efficient algorithms for online bayesian persuasion
Martino Bernasconi, Matteo Castiglioni, Andrea Celli, Alberto Marchesi, Francesco Trovò, and Nicola Gatti · 2023
Later among the works it cites.
Online information acquisition: Hiring multiple agents
Federico Cacciamani, Matteo Castiglioni, and Nicola Gatti · 2023
Later among the works it cites.
How bad is top- k k recommendation under competing content creators?
Fan Yao, Chuanhao Li, Denis Nekipelov, Hongning Wang, and Haifeng Xu · 2023
Later among the works it cites.
Online learning in stackelberg games with an omniscient follower
Geng Zhao, Banghua Zhu, Jiantao Jiao, and Michael Jordan · 2023
Later among the works it cites.
Online learning in a creator economy
Banghua Zhu, Sai Praneeth Karimireddy, Jiantao Jiao, and Michael I Jordan · 2023
Later among the works it cites.
https://neoreach.com/creator-earnings/
Creator earnings report breakdown, where are we in the creator economy? · 2024
Closest in time.
https://www.goldmansachs.com/intelligence/pages/the-creator-economy-could-approach-half-a-trillion-dollars-by-2027.html
The creator economy · 2024
Closest in time.
https://www.lemonde.fr/en/pixels/article/2024/04/13/tiktok-lite-a-new-app-quietly-released-in-france-that-rewards-screen-time_6668286_13.html
Tiktok lite, a new app quietly released in france that rewards screen time · 2024
Closest in time.
Nicole Immorlica, Meena Jagadeesan, and Brendan Lucier · 2024
Closest in time.
Delegated classification
Eden Saig, Inbal Talgam-Cohen, and Nir Rosenfeld · 2024
Closest in time.
Incentivized learning in principal-agent bandit games
Antoine Scheid, Daniil Tiapkin, Etienne Boursier, Aymeric Capitaine, El Mahdi El Mhamdi, Éric Moulines, Michael I Jordan, and Alain Durmus · 2024
Closest in time.
Rethinking incentives in recommender systems: Are monotone rewards always beneficial?
Fan Yao, Chuanhao Li, Karthik Abinav Sankararaman, Yiming Liao, Yan Zhu, Qifan Wang, Hongning Wang, and Haifeng Xu · 2024
Closest in time.
Shiliang Zuo · 2024
Closest in time.