Eugenio Bargiacchi, Timothy Verstraeten, Diederik Roijers, Ann Nowe, Hado van Hasselt
Learning to coordinate between multiple agents is an important problem in many reinforcement learning problems. Key to learning to coordinate is exploiting loose couplings, i.e., conditional independences between agents. In this paper we study learning in repeated fully cooperative games, multi-agent multi-armed bandits (MAMABs), in which the expected rewards can be expressed as a coordination graph. We propose multi-agent upper confidence exploration (MAUCE), a new algorithm for MAMABs that exploits loose couplings, which enables us to prove a regret bound that is logarithmic in the number of arm pulls and only linear in the number of agents. We empirically compare MAUCE to sparse cooperative Q-learning, and a state-of-the-art combinatorial bandit approach, and show that it performs much better on a variety of settings, including learning control policies for wind farms.
Bargiacchi, E, Verstraeten, T, Roijers, D, Nowe, A & van Hasselt, H 2018, Learning to Coordinate with Coordination Graphs in Repeated Single-Stage Multi-Agent Decision Problems. in J Dy & A Krause (eds), 35th International Conference on Machine Learning, ICML 2018. vol. 2, pp. 810-818, International Conference on Machine Learning 2018, Stockholm, Sweden, 10/07/18. <http://proceedings.mlr.press/v80/bargiacchi18a/bargiacchi18a.pdf>
Bargiacchi, E., Verstraeten, T., Roijers, D., Nowe, A., & van Hasselt, H. (2018). Learning to Coordinate with Coordination Graphs in Repeated Single-Stage Multi-Agent Decision Problems. In J. Dy, & A. Krause (Eds.), 35th International Conference on Machine Learning, ICML 2018 (Vol. 2, pp. 810-818) http://proceedings.mlr.press/v80/bargiacchi18a/bargiacchi18a.pdf
@inproceedings{f4e3e29163004c2aa5b4101d65ef04b3,
title = "Learning to Coordinate with Coordination Graphs in Repeated Single-Stage Multi-Agent Decision Problems",
abstract = "Learning to coordinate between multiple agents is an important problem in many reinforcement learning problems. Key to learning to coordinate is exploiting loose couplings, i.e., conditional independences between agents. In this paper we study learning in repeated fully cooperative games, multi-agent multi-armed bandits (MAMABs), in which the expected rewards can be expressed as a coordination graph. We propose multi-agent upper confidence exploration (MAUCE), a new algorithm for MAMABs that exploits loose couplings, which enables us to prove a regret bound that is logarithmic in the number of arm pulls and only linear in the number of agents. We empirically compare MAUCE to sparse cooperative Q-learning, and a state-of-the-art combinatorial bandit approach, and show that it performs much better on a variety of settings, including learning control policies for wind farms.",
author = "Eugenio Bargiacchi and Timothy Verstraeten and Diederik Roijers and Ann Nowe and {van Hasselt}, Hado",
year = "2018",
language = "English",
volume = "2",
pages = "810--818",
editor = "Jennifer Dy and Andreas Krause",
booktitle = "35th International Conference on Machine Learning, ICML 2018",
note = "International Conference on Machine Learning 2018 ; Conference date: 10-07-2018 Through 15-07-2018",
url = "https://icml.cc/",
}