An efficient algorithm for cooperative semi-bandits

MaRDI QIDQ7028633zbMATH OpenFDO

Authors Riccardo della Vecchia, Tommaso R. Cesari

Publication date 11 February 2025

Full work available at URL https://proceedings.mlr.press/v132/della-vecchia21a.html

zbMATH Keywords

follow the perturbed leadermulti-agent learningonline stochastic mirror descentregret minimization

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Agent technology and artificial intelligence (68T42) Stochastic programming (90C15) Combinatorial optimization (90C27) Probabilistic games; gambling (91A60)

Cites work

• An Efficient Algorithm for Learning with Semi-bandit Feedback
• Bandit algorithms
• Combinatorial bandits
• Competitive collaborative learning
• Delay and cooperation in nonstochastic bandits
• Efficient algorithms for online decision problems
• Finite-time analysis of the multiarmed bandit problem
• scientific article; zbMATH DE number 3128728 (Why is no real title available?)
• Nonstochastic Multi-Armed Bandits with Graph-Structured Feedback
• Online prediction under submodular constraints
• Regret in online combinatorial optimization

This page was built for publication: An efficient algorithm for cooperative semi-bandits

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7028633)