Collaborating in Multi-Armed Bandits with Strategic Agents
Fuente:
arXiv
Saved in:
| Main Authors: | Barnea, Idan, Schlisselberg, Ofir, Mansour, Yishay |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Individual Regret in Cooperative Stochastic Multi-Armed Bandits
by: Barnea, Idan, et al.
Published: (2024)
by: Barnea, Idan, et al.
Published: (2024)
Improved Best-of-Both-Worlds Regret for Bandits with Delayed Feedback
by: Schlisselberg, Ofir, et al.
Published: (2025)
by: Schlisselberg, Ofir, et al.
Published: (2025)
The Horizon Threshold in Cooperative Multi-Agent Reward-Free Exploration
by: Barnea, Idan, et al.
Published: (2026)
by: Barnea, Idan, et al.
Published: (2026)
Online Learning in MDPs with Partially Adversarial Transitions and Losses
by: Schlisselberg, Ofir, et al.
Published: (2026)
by: Schlisselberg, Ofir, et al.
Published: (2026)
Delay as Payoff in MAB
by: Schlisselberg, Ofir, et al.
Published: (2024)
by: Schlisselberg, Ofir, et al.
Published: (2024)
The Hidden Cost of Approximation in Online Mirror Descent
by: Schlisselberg, Ofir, et al.
Published: (2025)
by: Schlisselberg, Ofir, et al.
Published: (2025)
Non-stochastic Bandits With Evolving Observations
by: Bar-On, Yogev, et al.
Published: (2024)
by: Bar-On, Yogev, et al.
Published: (2024)
Optimal Regret for Policy Optimization in Contextual Bandits
by: Levy, Orin, et al.
Published: (2026)
by: Levy, Orin, et al.
Published: (2026)
The impact of allocation strategies in subset learning on the expressive power of neural networks
by: Schlisselberg, Ofir, et al.
Published: (2025)
by: Schlisselberg, Ofir, et al.
Published: (2025)
A Characterization of Semi-Supervised Adversarially-Robust PAC Learnability
by: Attias, Idan, et al.
Published: (2022)
by: Attias, Idan, et al.
Published: (2022)
Near-optimal Regret Using Policy Optimization in Online MDPs with Aggregate Bandit Feedback
by: Lancewicki, Tal, et al.
Published: (2025)
by: Lancewicki, Tal, et al.
Published: (2025)
Batch Ensemble for Variance Dependent Regret in Stochastic Bandits
by: Cassel, Asaf, et al.
Published: (2024)
by: Cassel, Asaf, et al.
Published: (2024)
Robust and Performance Incentivizing Algorithms for Multi-Armed Bandits with Strategic Agents
by: Esmaeili, Seyed A., et al.
Published: (2023)
by: Esmaeili, Seyed A., et al.
Published: (2023)
Collaborative Multi-Agent Heterogeneous Multi-Armed Bandits
by: Chawla, Ronshee, et al.
Published: (2023)
by: Chawla, Ronshee, et al.
Published: (2023)
Regret Bounds for Adversarial Contextual Bandits with General Function Approximation and Delayed Feedback
by: Levy, Orin, et al.
Published: (2025)
by: Levy, Orin, et al.
Published: (2025)
Collaborative Min-Max Regret in Grouped Multi-Armed Bandits
by: Blanchard, Moïse, et al.
Published: (2025)
by: Blanchard, Moïse, et al.
Published: (2025)
Distributed Algorithms for Multi-Agent Multi-Armed Bandits with Collision
by: Zhou, Daoyuan, et al.
Published: (2025)
by: Zhou, Daoyuan, et al.
Published: (2025)
Multi-Armed Bandits with Interference
by: Jia, Su, et al.
Published: (2024)
by: Jia, Su, et al.
Published: (2024)
Imprecise Multi-Armed Bandits
by: Kosoy, Vanessa
Published: (2024)
by: Kosoy, Vanessa
Published: (2024)
Learnability Gaps of Strategic Classification
by: Cohen, Lee, et al.
Published: (2024)
by: Cohen, Lee, et al.
Published: (2024)
The Real Price of Bandit Information in Multiclass Classification
by: Erez, Liad, et al.
Published: (2024)
by: Erez, Liad, et al.
Published: (2024)
Fast Rates for Bandit PAC Multiclass Classification
by: Erez, Liad, et al.
Published: (2024)
by: Erez, Liad, et al.
Published: (2024)
Fair Algorithms with Probing for Multi-Agent Multi-Armed Bandits
by: Xu, Tianyi, et al.
Published: (2025)
by: Xu, Tianyi, et al.
Published: (2025)
Rising Rested MAB with Linear Drift
by: Amichay, Omer, et al.
Published: (2025)
by: Amichay, Omer, et al.
Published: (2025)
Strategic Multi-Armed Bandit Problems Under Debt-Free Reporting
by: Yahmed, Ahmed Ben, et al.
Published: (2025)
by: Yahmed, Ahmed Ben, et al.
Published: (2025)
Flickering Multi-Armed Bandits
by: Chakraborty, Sourav, et al.
Published: (2026)
by: Chakraborty, Sourav, et al.
Published: (2026)
Competing Bandits: The Perils of Exploration Under Competition
by: Aridor, Guy, et al.
Published: (2020)
by: Aridor, Guy, et al.
Published: (2020)
Federated Combinatorial Multi-Agent Multi-Armed Bandits
by: Fourati, Fares, et al.
Published: (2024)
by: Fourati, Fares, et al.
Published: (2024)
Multi-Armed Bandits with Network Interference
by: Agarwal, Abhineet, et al.
Published: (2024)
by: Agarwal, Abhineet, et al.
Published: (2024)
Modeling Attrition in Recommender Systems with Departing Bandits
by: Ben-Porat, Omer, et al.
Published: (2022)
by: Ben-Porat, Omer, et al.
Published: (2022)
Rising Multi-Armed Bandits with Known Horizons
by: Song, Seockbean, et al.
Published: (2026)
by: Song, Seockbean, et al.
Published: (2026)
Optimal Streaming Algorithms for Multi-Armed Bandits
by: Jin, Tianyuan, et al.
Published: (2024)
by: Jin, Tianyuan, et al.
Published: (2024)
On the Regularity and Fairness of Combinatorial Multi-Armed Bandit
by: Wu, Xiaoyi, et al.
Published: (2025)
by: Wu, Xiaoyi, et al.
Published: (2025)
How to Boost Any Loss Function
by: Nock, Richard, et al.
Published: (2024)
by: Nock, Richard, et al.
Published: (2024)
Introduction to Multi-Armed Bandits
by: Slivkins, Aleksandrs
Published: (2019)
by: Slivkins, Aleksandrs
Published: (2019)
Autonomous Drug Design with Multi-Armed Bandits
by: Svensson, Hampus Gummesson, et al.
Published: (2022)
by: Svensson, Hampus Gummesson, et al.
Published: (2022)
Stochastic Multi-Armed Bandits with Limited Control Variates
by: Verma, Arun, et al.
Published: (2026)
by: Verma, Arun, et al.
Published: (2026)
Optimism in the Face of Ambiguity Principle for Multi-Armed Bandits
by: Li, Mengmeng, et al.
Published: (2024)
by: Li, Mengmeng, et al.
Published: (2024)
Federated Multi-Armed Bandits Under Byzantine Attacks
by: Saday, Artun, et al.
Published: (2022)
by: Saday, Artun, et al.
Published: (2022)
Multi-Agent Combinatorial-Multi-Armed-Bandit framework for the Submodular Welfare Problem under Bandit Feedback
by: Pokhriyal, Subham, et al.
Published: (2026)
by: Pokhriyal, Subham, et al.
Published: (2026)
Similar Items
-
Individual Regret in Cooperative Stochastic Multi-Armed Bandits
by: Barnea, Idan, et al.
Published: (2024) -
Improved Best-of-Both-Worlds Regret for Bandits with Delayed Feedback
by: Schlisselberg, Ofir, et al.
Published: (2025) -
The Horizon Threshold in Cooperative Multi-Agent Reward-Free Exploration
by: Barnea, Idan, et al.
Published: (2026) -
Online Learning in MDPs with Partially Adversarial Transitions and Losses
by: Schlisselberg, Ofir, et al.
Published: (2026) -
Delay as Payoff in MAB
by: Schlisselberg, Ofir, et al.
Published: (2024)