English
Related papers

Related papers: Incentivizing Exploration in Linear Bandits under …

200 papers

Individual decision-makers consume information revealed by the previous decision makers, and produce information that may help in future decisions. This phenomenon is common in a wide range of scenarios in the Internet economy, as well as…

Computer Science and Game Theory · Computer Science 2019-05-06 Yishay Mansour , Aleksandrs Slivkins , Vasilis Syrgkanis

We study incentivized exploration in multi-armed bandit (MAB) settings with infinitely many arms modeled as elements in continuous metric spaces. Unlike classical bandit models, we consider scenarios where the decision-maker (principal)…

Machine Learning · Computer Science 2025-08-28 Sourav Chakraborty , Amit Kiran Rege , Claire Monteleoni , Lijun Chen

We propose a contextual bandit based model to capture the learning and social welfare goals of a web platform in the presence of myopic users. By using payments to incentivize these agents to explore different items/recommendations, we show…

Machine Learning · Computer Science 2020-01-23 Priyank Agrawal , Theja Tulabandhula

We study incentivized exploration for the multi-armed bandit (MAB) problem with non-stationary reward distributions, where players receive compensation for exploring arms other than the greedy choice and may provide biased feedback on the…

Machine Learning · Computer Science 2024-03-19 Sourav Chakraborty , Lijun Chen

Pure exploration in multi-armed bandits has emerged as an important framework for modeling decision-making and search under uncertainty. In modern applications, however, one is often faced with a tremendously large number of options. Even…

Machine Learning · Computer Science 2022-11-22 Parth K. Thaker , Mohit Malu , Nikhil Rao , Gautam Dasarathy

In the latent bandit problem, the learner has access to reward distributions and -- for the non-stationary variant -- transition models of the environment. The reward distributions are conditioned on the arm and unknown latent states. The…

Machine Learning · Computer Science 2022-07-11 Alexander Galozy , Slawomir Nowaczyk

We study incentivized exploration for the multi-armed bandit (MAB) problem where the players receive compensation for exploring arms other than the greedy choice and may provide biased feedback on reward. We seek to understand the impact of…

Machine Learning · Computer Science 2019-12-17 Zhiyuan Liu , Huazheng Wang , Fan Shen , Kai Liu , Lijun Chen

We introduce the "inverse bandit" problem of estimating the rewards of a multi-armed bandit instance from observing the learning process of a low-regret demonstrator. Existing approaches to the related problem of inverse reinforcement…

Machine Learning · Statistics 2022-02-23 Wenshuo Guo , Kumar Krishna Agrawal , Aditya Grover , Vidya Muthukumar , Ashwin Pananjady

Proper balance between exploitation and exploration is what makes good decisions, which achieve high rewards like payoff or evolutionary fitness. The Infomax principle postulates that maximization of information directs the function of…

Machine Learning · Computer Science 2016-05-25 Gautam Reddy , Antonio Celani , Massimo Vergassola

We advance the study of incentivized bandit exploration, in which arm choices are viewed as recommendations and are required to be Bayesian incentive compatible. Recent work has shown under certain independence assumptions that after…

Computer Science and Game Theory · Computer Science 2024-09-25 Mark Sellke

In this paper, we investigate a new multi-armed bandit (MAB) online learning model that considers real-world phenomena in many recommender systems: (i) the learning agent cannot pull the arms by itself and thus has to offer rewards to users…

Machine Learning · Computer Science 2021-06-01 Tianchen Zhou , Jia Liu , Chaosheng Dong , Jingyuan Deng

Multi-Armed Bandit (MAB) algorithms are widely used in recommender systems that require continuous, incremental learning. A core aspect of MABs is the exploration-exploitation trade-off: choosing between exploiting items likely to be…

Machine Learning · Computer Science 2026-04-20 Pedro R. Pires , Gregorio F. Azevedo , Pietro L. Campos , Rafael T. Sereicikas , Tiago A. Almeida

Incentivized exploration in multi-armed bandits (MAB) has witnessed increasing interests and many progresses in recent years, where a principal offers bonuses to agents to do explorations on her behalf. However, almost all existing studies…

Machine Learning · Statistics 2021-10-28 Chengshuai Shi , Haifeng Xu , Wei Xiong , Cong Shen

Consider a bandit algorithm that recommends actions to self-interested users in a recommendation system. The users are free to choose other actions and need to be incentivized to follow the algorithm's recommendations. While the users…

Machine Learning · Computer Science 2022-06-02 Xinyan Hu , Dung Daniel Ngo , Aleksandrs Slivkins , Zhiwei Steven Wu

We study here the problem of learning the exploration exploitation trade-off in the contextual bandit problem with linear reward function setting. In the traditional algorithms that solve the contextual bandit problem, the exploration is a…

Machine Learning · Computer Science 2020-05-06 Djallel Bouneffouf , Emmanuelle Claeys

We study the challenging exploration incentive problem in both bandit and reinforcement learning, where the rewards are scale-free and potentially unbounded, driven by real-world scenarios and differing from existing work. Past works in…

Machine Learning · Computer Science 2024-05-07 Mengfan Xu , Diego Klabjan

In the incentivized exploration model, a principal aims to explore and learn over time by interacting with a sequence of self-interested agents. It has been recently understood that the main challenge in designing incentive-compatible…

Computer Science and Game Theory · Computer Science 2025-06-03 Benjamin Schiffer , Mark Sellke

Most online platforms strive to learn from interactions with users, and many engage in exploration: making potentially suboptimal choices for the sake of acquiring new information. We study the interplay between exploration and competition:…

Computer Science and Game Theory · Computer Science 2024-10-15 Guy Aridor , Yishay Mansour , Aleksandrs Slivkins , Zhiwei Steven Wu

Sparse reward environments are known to be challenging for reinforcement learning agents. In such environments, efficient and scalable exploration is crucial. Exploration is a means by which an agent gains information about the environment.…

Machine Learning · Computer Science 2023-10-11 Jacob Chmura , Hasham Burhani , Xiao Qi Shi

We consider a novel variant of the contextual bandit problem (i.e., the multi-armed bandit with side-information, or context, available to a decision-maker) where the reward associated with each context-based decision may not always be…

Machine Learning · Computer Science 2020-07-21 Djallel Bouneffouf , Sohini Upadhyay , Yasaman Khazaeni
‹ Prev 1 2 3 10 Next ›