arXiv Machine Learning October 22, 2026 By Mingxiao Li, Wenhai Lai, Hongyu Wang

Characterizing Oblivious Common-Reward Multi-Player Bandits: Universal Stationarity, Coordination Traps, and Certified Global Rates

Read the original on arXiv Machine Learning →

The Flow has not summarised this story yet — read it at arXiv Machine Learning.

reinforcement-learning

arXiv Machine Learning

Jun 5

Multi-Agent Lipschitz Bandits

arXiv:2602. 16965v2 Announce Type: replace Abstract: We study the decentralized multi-player stochastic bandit problem over a continuous, Lipschitz-structured action space where hard collisions yield zero reward.

By Sourav Chakraborty, Amit Kiran Rege, Claire Monteleoni, Lijun Chen

agents reinforcement-learning

arXiv AI

Aug 12

Coordinating the Unknown Lipschitz Constant in Multiplayer Bandits

arXiv:2608. 10526v1 Announce Type: cross Abstract: Motivated by decentralized applications, we study cooperative multi-agent bandits in continuous (Lipschitz) action spaces when the Lipschitz constant is unknown.

By Ricardo Parada, Chenzhang Zhao, William Chang

agents reinforcement-learning efficiency

arXiv Machine Learning

Jun 29

Learning in Markovian bandits with non-observable states and constrained decision epochs

arXiv:2606. 27448v1 Announce Type: new Abstract: This paper studies the problem of regret minimization in Markovian bandits with \emph{non-observable states} and possibly \emph{constrained} decision epochs.

By Thomas Hira, Victor Boone, Urtzi Ayesta, Ina Maria Verloop

reinforcement-learning benchmarks safety

arXiv Machine Learning

Sep 15

Toward Optimal Switching Regret for Multi-Armed Bandits with Oblivious Adversary

arXiv:2609.13547v1 Announce Type: new Abstract: We study switching regret in adversarial multi-armed bandits, where the learner competes with an arm sequence that changes at most $S$ times. When $S$...

By Mengxiao Zhang

safety

arXiv Machine Learning

Jun 30

Optimal Regret for Single Index Bandits

arXiv:2605. 09454v2 Announce Type: replace-cross Abstract: We study the $\textit{single-index bandit}$ problem, where rewards depend on an unknown one-dimensional projection of high-dimensional contexts through an unknown reward function.

By Devdan Dey, Sujoy Bhore, Avishek Ghosh

reinforcement-learning

arXiv Statistics ML

Oct 15

Thompson Sampling for Learning in Zero-Sum Games

arXiv:2610.18899v1 Announce Type: cross Abstract: Thompson sampling (TS) achieves logarithmic and asymptotically optimal regret in classical stochastic bandits, but its behavior in multi-agent learni...

By Kenshi Abe, Kaito Ariu, Po-An Wang

agents reinforcement-learning

One email a morning, machine-written

Related stories

Multi-Agent Lipschitz Bandits

Coordinating the Unknown Lipschitz Constant in Multiplayer Bandits

Learning in Markovian bandits with non-observable states and constrained decision epochs

Toward Optimal Switching Regret for Multi-Armed Bandits with Oblivious Adversary

Optimal Regret for Single Index Bandits

Thompson Sampling for Learning in Zero-Sum Games