The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
Value-Decomposition Networks For Cooperative Multi-Agent Learning Based On Team Reward
Abstract
We study the problem of cooperative multi-agent reinforcement learning with a single joint reward signal. This class of learning problems is difficult because of the often large combined action and observation spaces. In the fully centralized and decentralized approaches, we find the problem of spurious rewards and a phenomenon we call the "lazy agent'' problem, which arises due to partial observability. We address these problems by training individual agents with a novel value-decomposition network architecture, which learns to decompose the team value function into agent-wise value functions.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A Comprehensive Survey of Multiagent Reinforcement Learning
Busoniu, L., Babuska, R., & De Schutter, B. (2008) · IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews) · doi:10.1109/tsmcc.2007.913919 · Cited by 2,235
Counterfactual Multi-Agent Policy Gradients
Foerster, J., Farquhar, G., Afouras, T., Nardelli, N., & Whiteson, S. (2018) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v32i1.11794 · Cited by 1,873
Cooperative Multi-Agent Learning: The State of the Art
Panait, L., & Luke, S. (2005) · Autonomous Agents and Multi-Agent Systems · doi:10.1007/s10458-005-2631-2 · Cited by 1,237
The dynamics of reinforcement learning in cooperative multiagent systems
Claus, C., & Boutilier, C. E. (1998) · Cited by 1,089
A Concise Introduction to Decentralized POMDPs
Oliehoek, F. A., & Amato, C. (2016) · SpringerBriefs in Intelligent Systems · doi:10.1007/978-3-319-28929-8 · Cited by 968
Multi-agent Reinforcement Learning in Sequential Social Dilemmas
Leibo, J. Z., Zambaldi, V., Lanctot, M., Marecki, J., & Graepel, T. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1702.03037 · Cited by 263
Self-citationLearning Multiagent Communication with Backpropagation
Sukhbaatar, S., Szlam, A. D., & Fergus, R. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1605.07736 · Cited by 261
The Complexity of Decentralized Control of Markov Decision Processes
Bernstein, D. S., Shlomo Zilberstein, B., & Immerman, N. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1301.3836 · Cited by 232
Multiagent Reinforcement Learning for Urban Traffic Control Using Coordination Graphs
Kuyer, L., Whiteson, S., Bakker, B., & Vlassis, N. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-87479-9_61 · Cited by 231
Multiagent Learning: Basics, Challenges, and Prospects
Tuyls, K., & Weiss, G. (2012) · AI Magazine · doi:10.1609/aimag.v33i3.2426 · Cited by 179
Self-citation
Cited by
Multi-Agent Reinforcement Learning: A Selective Overview of Theories and Algorithms
Zhang, K., Yang, Z., & Başar, T. (2021) · Studies in Systems, Decision and Control · doi:10.1007/978-3-030-60990-0_12 · Cited by 1,264
Multi-agent deep reinforcement learning: a survey
Gronauer, S., & Diepold, K. (2022) · Artificial Intelligence Review · doi:10.1007/s10462-021-09996-w · Cited by 957
A survey and critique of multiagent deep reinforcement learning
Hernandez-Leal, P., Kartal, B., & Taylor, M. E. (2019) · Autonomous Agents and Multi-Agent Systems · doi:10.1007/s10458-019-09421-1 · Cited by 671
A review of cooperative multi-agent deep reinforcement learning
Oroojlooy, A., & Hajinezhad, D. (2023) · Applied Intelligence · doi:10.1007/s10489-022-04105-y · Cited by 482
Single and multi-agent deep reinforcement learning for AI-enabled wireless networks: A tutorial
Feriani, A., & Hossain, E. (2021) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2021.3063822 · Cited by 410
Multi-Agent Reinforcement Learning: A Review of Challenges and Applications
Canese, L., Cardarilli, G. C., Di Nunzio, L., Fazzolari, R., Giardino, D., Re, M., & Spanò, S. (2021) · Applied Sciences · doi:10.3390/app11114948 · Cited by 403
QMIX: Monotonic Value Function Factorisation for Deep Multi-Agent Reinforcement Learning
Rashid, T., Samvelyan, M., de Witt, C. S., Farquhar, G., Foerster, J., & Whiteson, S. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1803.11485 · Cited by 326
Hua, M., Qi, X., Chen, D., Jiang, K., Liu, Z. E., Sun, H., Zhou, Q., & Xu, H. (2025) · IEEE Transactions on Automation Science and Engineering · doi:10.1109/tase.2025.3574280 · Cited by 88
“Building upon foundational methods like VDN [76] and QMIX [77], several advanced algorithms have been developed to tackle increasingly complex scenarios.”
Social Diversity and Social Preferences in Mixed-Motive Reinforcement Learning
McKee, K. R., Gemp, I., McWilliams, B., Duèñez-Guzmán, E. A., Hughes, E., & Leibo, J. Z. (2020) · International Joint Conference on Autonomous Agents and Multiagent Systems · doi:10.65109/dnuf7773 · Cited by 33
Self-citationMARNet: Backdoor Attacks Against Cooperative Multi-Agent Reinforcement Learning
Chen, Y., Zheng, Z., & Gong, X. (2023) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2022.3207429 · Cited by 32
Learning Reciprocity in Complex Sequential Social Dilemmas
Eccles, T., Hughes, E., Kramár, J., Wheelwright, S., & Leibo, J. Z. (2019) · arXiv · doi:10.48550/arxiv.1903.08082 · Cited by 19
Self-citationEnvironment Complexity and Nash Equilibria in a Sequential Social Dilemma
Yasir, M., Howes, A., Mavroudis, V., & Hicks, C. (2024) · arXiv · doi:10.48550/arxiv.2408.02148 · Cited by 1
“MARL methods have shown considerable success both in competitive environments [9, 32] and in purely cooperative environments [27, 4].”
Background
Metadata
- Authors
- Sunehag, P., Lever, G., Gruslys, A., Czarnecki, W. M., Zambaldi, V., Jaderberg, M., Lanctot, M., Sonnerat, N., Leibo, J. Z., Tuyls, K., & Graepel, T.
- Venue
- International Joint Conference on Autonomous Agents and Multiagent Systems
- Publisher
- IEEE Computer Society
- Published
- 2018-07-09
- Pages
- 2085-2087
- ISSN
- 1548-8403 (ISSN-L)
- 1558-2914
- OpenAlex
- W2807741983
- Cited by
- 618
- References
- 20
- FWCI
- 22.16
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.