Fetching the paper…
Reading the bibliography…
We study a strategic variant of the multi-armed bandit problem, which we coin the strategic click-bandit.
A further generalization of the kakutani fixed point theorem, with application to nash equilibrium points
Irving L Glicksberg · 1952
Earlier work this paper cites.
Asymptotically efficient adaptive allocation rules
Tze Leung Lai, Herbert Robbins, et al · 1985
Earlier work this paper cites.
Algorithmic mechanism design
Noam Nisan and Amir Ronen · 1999
Earlier work this paper cites.
On the existence of pure and mixed strategy nash equilibria in discontinuous games
Philip J Reny · 1999
Earlier work this paper cites.
Using confidence bounds for exploitation-exploration trade-offs
Peter Auer · 2002
Earlier work this paper cites.
The sample complexity of exploration in the multi-armed bandit problem
Shie Mannor and John N Tsitsiklis · 2004
Earlier work this paper cites.
Online mechanisms
David C Parkes · 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.
The price of truthfulness for pay-per-click auctions
Nikhil R Devanur and Sham M Kakade · 2009
Earlier work this paper cites.
A contextual-bandit approach to personalized news article recommendation
Lihong Li, Wei Chu, John Langford, and Robert E Schapire · 2010
Earlier work this paper cites.
Beyond position bias: Examining result attractiveness as a source of presentation bias in clickthrough data
Yisong Yue, Rajan Patel, and Hein Roehrig · 2010
Earlier work this paper cites.
A truthful learning mechanism for contextual multi-slot sponsored search auctions with externalities
Nicola Gatti, Alessandro Lazaric, and Francesco Trovò · 2012
Earlier work this paper cites.
On caption bias in interleaving experiments
Katja Hofmann, Fritz Behr, and Filip Radlinski · 2012
Earlier work this paper cites.
Learning and incentives in user-generated content: Multi-armed bandits with endogenous arms
Arpita Ghosh and Patrick Hummel · 2013
Earlier work this paper cites.
Dynamic mechanism design: A myersonian approach
Alessandro Pavan, Ilya Segal, and Juuso Toikka · 2014
Cited alongside, same era.
Truthful mechanisms with implicit payment computation
Moshe Babaioff, Robert D Kleinberg, and Aleksandrs Slivkins · 2015
Cited alongside, same era.
Strategic classification
Moritz Hardt, Nimrod Megiddo, Christos Papadimitriou, and Mary Wootters · 2016
Cited alongside, same era.
Where to sell: Simulating auctions from learning algorithms
Hamid Nazerzadeh, Renato Paes Leme, Afshin Rostamizadeh, and Umar Syed · 2016
Cited alongside, same era.
Cascading bandits for large-scale recommendation problems
Shi Zong, Hao Ni, Kenny Sung, Nan Rosemary Ke, Zheng Wen, and Branislav Kveton · 2016
Cited alongside, same era.
Factorization bandits for interactive recommendation
Huazheng Wang, Qingyun Wu, and Hongning Wang · 2017
Bandit algorithms
Tor Lattimore and Csaba Szepesvári · 2020
Later among the works it cites.
Auction-based combinatorial multi-armed bandit mechanisms with strategic arms
Guoju Gao, He Huang, Mingjun Xiao, Jie Wu, Yu-E Sun, and Sheng Zhang · 2021
Later among the works it cites.
Clicks can be cheating: Counterfactual recommendation for mitigating clickbait issue
Wenjie Wang, Fuli Feng, Xiangnan He, Hanwang Zhang, and Tat-Seng Chua · 2021
Later among the works it cites.
Incentive-aware pac learning
Hanrui Zhang and Vincent Conitzer · 2021
Later among the works it cites.
Combinatorial bandits under strategic manipulations
Jing Dong, Ke Li, Shuai Li, and Baoxiang Wang · 2022
Later among the works it cites.
Modeling content creator incentives on algorithm-curated platforms
Jiri Hron, Karl Krauth, Michael I Jordan, Niki Kilbertus, and Sarah Dean · 2022
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Incentivizing high quality user contributions: New arm generation in bandit learning
Yang Liu and Chien-Ju Ho · 2018
Cited alongside, same era.
Dynamic mechanism design: An introduction
Dirk Bergemann and Juuso Välimäki · 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.
Explore first, exploit next: The true shape of regret in bandit problems
Aurélien Garivier, Pierre Ménard, and Gilles Stoltz · 2019
Cited alongside, same era.
Introduction to multi-armed bandits
Aleksandrs Slivkins et al · 2019
Cited alongside, same era.
Survey on applications of multi-armed and contextual bandits
Djallel Bouneffouf, Irina Rish, and Charu Aggarwal · 2020
Cited alongside, same era.
Later among the works it cites.
Multi-armed bandit algorithm against strategic replication
Suho Shin, Seungjoon Lee, and Jungseul Ok · 2022
Later among the works it cites.
Improved online learning algorithms for ctr prediction in ad auctions
Zhe Feng, Christopher Liaw, and Zixin Zhou · 2023
Closest in time.
Incentivizing high-quality content in online recommender systems
Xinyan Hu, Meena Jagadeesan, Michael I Jordan, and Jacob Steinhard · 2023
Closest in time.
Vcg mechanism design with unknown agent values under stochastic bandit feedback
Kirthevasan Kandasamy, Joseph E Gonzalez, Michael I Jordan, and Ion Stoica · 2023
Closest in time.
On the robustness of epoch-greedy in multi-agent contextual bandit mechanisms
Yinglun Xu, Bhuvesh Kumar, and Jacob Abernethy · 2023
Closest in time.
How to earn money on YouTube, 2023
Youtube · 2023
Closest in time.
Online learning in contextual second-price pay-per-click auctions
Mengxiao Zhang and Haipeng Luo · 2023
Closest in time.