Distributed cooperative decision making in multi-agent multi-armed bandits

DOI10.1016/j.automatica.2020.109445zbMath1460.91070arXiv2003.01312OpenAlexW3118244830MaRDI QIDQ2663944

Peter Landgren, Naomi Ehrich Leonard, Vaibhav Srivastava

Publication date: 20 April 2021

Published in: Automatica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2003.01312

zbMATH Keywords

multi-agent systemsdistributed decision makingmulti-armed banditsexplore-exploit dilemma

Mathematics Subject Classification ID

Decision theory (91B06) Multi-agent systems (93A16) Consensus (93D50)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Asymptotically efficient adaptive allocation rules
• Concentration Inequalities
• Information Centrality and Ordering of Nodes for Accuracy in Noisy Decision-Making Networks
• Decentralized Learning for Multiplayer Multiarmed Bandits
• Asymptotically efficient allocation rules for the multiarmed bandit problem with multiple plays-Part I: I.I.D. rewards
• Enforcing Consensus While Monitoring the Environment in Wireless Sensor Networks
• Distributed Learning in Multi-Armed Bandit With Multiple Players
• Distributed Stochastic Online Learning Policies for Opportunistic Spectrum Access
• Achieving Pareto Optimality Through Distributed Learning
• Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
• Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems
• Finite-time analysis of the multiarmed bandit problem

This page was built for publication: Distributed cooperative decision making in multi-agent multi-armed bandits