Game of Thrones: Fully Distributed Learning for Multiplayer Bandits

DOI10.1287/moor.2020.1051zbMath1466.91018arXiv1810.11162OpenAlexW2912712349MaRDI QIDQ4991671

Ilai Bistritz, Amir Leshem

Publication date: 3 June 2021

Published in: Mathematics of Operations Research (Search for Journal in Brave)

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

zbMATH Keywords

game theoryresource allocationmultiagent learningmultiarmed bandits

Mathematics Subject Classification ID

Stochastic games, stochastic differential games (91A15) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Learning efficient Nash equilibria in distributed systems
• Asymptotically efficient adaptive allocation rules
• The auction algorithm: A distributed relaxation method for the assignment problem
• Chernoff-Hoeffding Bounds for Markov Chains: Generalized and Simplified
• Decentralized Learning for Multiplayer Multiarmed Bandits
• Learning in a Changing World: Restless Multiarmed Bandit With Unknown Dynamics
• Online Learning of Rested and Restless Bandits
• Partially Observed Markov Decision Process Multiarmed Bandits—Structural Results
• Markov Decision Processes with Arbitrary Reward Processes
• On Regret-Optimal Learning in Decentralized Multiplayer Multiarmed Bandits
• Distributed Learning in Multi-Armed Bandit With Multiple Players
• Fully Distributed Optimal Channel Assignment for Open Spectrum Access
• MNL-Bandit: A Dynamic Learning Approach to Assortment Selection
• Regret in Online Combinatorial Optimization
• Achieving Pareto Optimality Through Distributed Learning
• Learning to Optimize via Posterior Sampling
• Regret Minimization Under Partial Monitoring
• Risk-Sensitive and Risk-Neutral Multiarmed Bandits

This page was built for publication: Game of Thrones: Fully Distributed Learning for Multiplayer Bandits