3 papers
cs.AI2026
Improved Multiplayer Bandit Algorithm for Bernoulli Rewards
Khang Nguyen, Ricardo Parada, William Chang
We study the multiplayer multi-armed bandit problem with information asymmetry under Bernoulli rewards, for three information structures: asymmetry in actions, in rewards, and in b…
math.AP2026
Generalised higher order vectorial -eigenvalue problems
William Chang, Nikos Katzourakis
We study the problem of minimising the norm of a function of the -th derivative over a class of maps, subject to a constraint involving the norm of a funct…
cs.LG2026
Robust Multi-Agent Bandits with Heavy-Tailed Rewards and Information Asymmetry
Daphne Feng, Ricardo Parada, Lily Jiang +2
The multi-armed bandit problem is a central framework in sequential decision-making, extensively studied under sub-Gaussian reward assumptions. However, real-world applications oft…