Imagen de Portada

Multi-Agent Combinatorial-Multi-Armed-Bandit framework for the Submodular Welfare Problem under Bandit Feedback

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Pokhriyal, Subham, Jain, Shweta, Aggarwal, Vaneet
Formato:	Preprint
Publicado:	2026
Materias:	Computer Science and Game Theory Machine Learning
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

A Resilience Framework for Bi-Criteria Combinatorial Optimization with Bandit Feedback
por: Aggarwal, Vaneet, et al.
Publicado: (2025)

Strategic Multi-Armed Bandit Problems Under Debt-Free Reporting
por: Yahmed, Ahmed Ben, et al.
Publicado: (2025)

Robust and Performance Incentivizing Algorithms for Multi-Armed Bandits with Strategic Agents
por: Esmaeili, Seyed A., et al.
Publicado: (2023)

Achieving PAC Guarantees in Mechanism Design through Multi-Armed Bandits
por: Osogami, Takayuki, et al.
Publicado: (2024)

Two-Player Zero-Sum Games with Bandit Feedback
por: Yılmaz, Elif, et al.
Publicado: (2025)

Online Budget Allocation with Censored Semi-Bandit Feedback
por: Bachoc, François, et al.
Publicado: (2025)

Procedural Fairness in Multi-Agent Bandits
por: Caiata, Joshua, et al.
Publicado: (2026)

Incentivized Learning in Principal-Agent Bandit Games
por: Scheid, Antoine, et al.
Publicado: (2024)

Heterogeneous Multi-Agent Bandits with Parsimonious Hints
por: Mirfakhar, Amirmahdi, et al.
Publicado: (2025)

Federated Combinatorial Multi-Agent Multi-Armed Bandits
por: Fourati, Fares, et al.
Publicado: (2024)

Strategic Linear Contextual Bandits
por: Buening, Thomas Kleine, et al.
Publicado: (2024)

Bandits with Preference Feedback: A Stackelberg Game Perspective
por: Pásztor, Barna, et al.
Publicado: (2024)

Efficient Uncoupled Learning Dynamics with $\tilde{O}\!\left(T^{-1/4}\right)$ Last-Iterate Convergence in Bilinear Saddle-Point Problems over Convex Sets under Bandit Feedback
por: Maiti, Arnab, et al.
Publicado: (2026)

Truthful Reverse Auctions for Adaptive Selection via Contextual Multi-Armed Bandits
por: Patra, Pronoy, et al.
Publicado: (2026)

Fair and Welfare-Efficient Constrained Multi-matchings under Uncertainty
por: Lobo, Elita, et al.
Publicado: (2024)

Regret Analysis of Sleeping Competing Bandits
por: Uba, Shinnosuke, et al.
Publicado: (2026)

p-Mean Regret for Stochastic Bandits
por: Krishna, Anand, et al.
Publicado: (2024)

Incentivized Truthful Communication for Federated Bandits
por: Wei, Zhepei, et al.
Publicado: (2024)

Adaptive Bandit Algorithms for Contextual Matching Markets
por: Lin, Shiyun, et al.
Publicado: (2026)

Incentive-compatible Bandits: Importance Weighting No More
por: Zimmert, Julian, et al.
Publicado: (2024)

Protocols for Verifying Smooth Strategies in Bandits and Games
por: Christ, Miranda, et al.
Publicado: (2025)

Efficient Near-Optimal Algorithm for Online Shortest Paths in Directed Acyclic Graphs with Bandit Feedback Against Adaptive Adversaries
por: Maiti, Arnab, et al.
Publicado: (2025)

Bandit Learning in Matching Markets: Utilitarian and Rawlsian Perspectives
por: Hosseini, Hadi, et al.
Publicado: (2024)

Doubly Optimal No-Regret Online Learning in Strongly Monotone Games with Bandit Feedback
por: Ba, Wenjia, et al.
Publicado: (2021)

Improved Bandits in Many-to-one Matching Markets with Incentive Compatibility
por: Kong, Fang, et al.
Publicado: (2024)

Honor Among Bandits: No-Regret Learning for Online Fair Division
por: Procaccia, Ariel D., et al.
Publicado: (2024)

Improved Regret Bounds for Online Fair Division with Bandit Learning
por: Schiffer, Benjamin, et al.
Publicado: (2025)

Nearly-Optimal Bandit Learning in Stackelberg Games with Side Information
por: Balcan, Maria-Florina, et al.
Publicado: (2025)

Preferences Evolve And So Should Your Bandits: Bandits with Evolving States for Online Platforms
por: Khosravi, Khashayar, et al.
Publicado: (2023)

Blind Network Revenue Management and Bandits with Knapsacks under Limited Switches
por: Simchi-Levi, David, et al.
Publicado: (2019)

Bandit Social Learning: Exploration under Myopic Behavior
por: Banihashem, Kiarash, et al.
Publicado: (2023)

No-Regret Learning for Fair Multi-Agent Social Welfare Optimization
por: Zhang, Mengxiao, et al.
Publicado: (2024)

Prudent-Banker: No Extra Fees for Baseline Safety in Adversarial Bandits With and Without Delays
por: Hu, Ting, et al.
Publicado: (2026)

Stochastic Submodular Bandits with Delayed Composite Anonymous Bandit Feedback
por: Pedramfar, Mohammad, et al.
Publicado: (2023)

Uncoupled and Convergent Learning in Monotone Games under Bandit Feedback
por: Dong, Jing, et al.
Publicado: (2024)

Multiplayer Bandit Learning, from Competition to Cooperation
por: Brânzei, Simina, et al.
Publicado: (2019)

Competing Bandits: The Perils of Exploration Under Competition
por: Aridor, Guy, et al.
Publicado: (2020)

Stochastic $k$-Submodular Bandits with Full Bandit Feedback
por: Nie, Guanyu, et al.
Publicado: (2024)

Randomised Optimism via Competitive Co-Evolution for Matrix Games with Bandit Feedback
por: Lin, Shishen
Publicado: (2025)

Dynamic Matching Bandit For Two-Sided Online Markets
por: Li, Yuantong, et al.
Publicado: (2022)