{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/value-decomposition-networks-for-cooperative","title":"Value-Decomposition Networks For Cooperative Multi-Agent Learning","arxiv_id":"1706.05296","date":"2017-06-16","proceeding":null,"authors":["Peter Sunehag","Guy Lever","Audrunas Gruslys","Wojciech Marian Czarnecki","Vinicius Zambaldi","Max Jaderberg","Marc Lanctot","Nicolas Sonnerat","Joel Z. Leibo","Karl Tuyls","Thore Graepel"],"abstract":"We study the problem of cooperative multi-agent reinforcement learning with a\nsingle joint reward signal. This class of learning problems is difficult\nbecause of the often large combined action and observation spaces. In the fully\ncentralized and decentralized approaches, we find the problem of spurious\nrewards and a phenomenon we call the \"lazy agent\" problem, which arises due to\npartial observability. We address these problems by training individual agents\nwith a novel value decomposition network architecture, which learns to\ndecompose the team value function into agent-wise value functions. We perform\nan experimental evaluation across a range of partially-observable multi-agent\ndomains and show that learning such value-decompositions leads to superior\nresults, in particular when combined with weight sharing, role information and\ninformation channels.","url_abs":"http://arxiv.org/abs/1706.05296v1","url_pdf":"http://arxiv.org/pdf/1706.05296v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"value-decomposition-networks-for-cooperative","repo_url":"https://github.com/Louiii/ValueDecomposition","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"unanswered"}},{"paper_slug":"value-decomposition-networks-for-cooperative","repo_url":"https://github.com/TonghanWang/DOP","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"value-decomposition-networks-for-cooperative","repo_url":"https://github.com/TonghanWang/NDQ","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"value-decomposition-networks-for-cooperative","repo_url":"https://github.com/cathyhxh/ctds","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"value-decomposition-networks-for-cooperative","repo_url":"https://github.com/facebookresearch/benchmarl","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"value-decomposition-networks-for-cooperative","repo_url":"https://github.com/hhhusiyi-monash/UPDeT","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"unanswered"}},{"paper_slug":"value-decomposition-networks-for-cooperative","repo_url":"https://github.com/jjbong/strangeness_exploration","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"unanswered"}},{"paper_slug":"value-decomposition-networks-for-cooperative","repo_url":"https://github.com/jugg1er/air","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"Apache-2.0"}},{"paper_slug":"value-decomposition-networks-for-cooperative","repo_url":"https://github.com/puyuan1996/MARL","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"value-decomposition-networks-for-cooperative","repo_url":"https://github.com/tjuhaoxiaotian/pymarl3","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"unanswered"}}],"tasks":[{"task_slug":"multi-agent-reinforcement-learning","task_name":"Multi-agent Reinforcement Learning"},{"task_slug":"reinforcement-learning","task_name":"Reinforcement Learning"},{"task_slug":"reinforcement-learning-1","task_name":"Reinforcement Learning (RL)"},{"task_slug":"smac-1","task_name":"SMAC+"},{"task_slug":"reinforcement-learning-2","task_name":"reinforcement-learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/smac-on-smac-def-armored-parallel","task":"SMAC+","dataset":"Def_Armored_parallel","model":"VDN","rank_in_archive_order":5,"of":10,"metrics":{"Median Win Rate":"5.0"},"uses_additional_data":false},{"leaderboard":"/sota/smac-on-smac-def-armored-sequential","task":"SMAC+","dataset":"Def_Armored_sequential","model":"VDN","rank_in_archive_order":2,"of":11,"metrics":{"Median Win Rate":"96.9"},"uses_additional_data":false},{"leaderboard":"/sota/smac-on-smac-def-infantry-parallel","task":"SMAC+","dataset":"Def_Infantry_parallel","model":"VDN","rank_in_archive_order":4,"of":10,"metrics":{"Median Win Rate":"95.0"},"uses_additional_data":false},{"leaderboard":"/sota/smac-on-smac-def-infantry-sequential","task":"SMAC+","dataset":"Def_Infantry_sequential","model":"VDN","rank_in_archive_order":6,"of":11,"metrics":{"Median Win Rate":"96.9"},"uses_additional_data":false},{"leaderboard":"/sota/smac-on-smac-def-outnumbered-parallel","task":"SMAC+","dataset":"Def_Outnumbered_parallel","model":"VDN","rank_in_archive_order":8,"of":10,"metrics":{"Median Win Rate":"0.0"},"uses_additional_data":false},{"leaderboard":"/sota/smac-on-smac-def-outnumbered-sequential","task":"SMAC+","dataset":"Def_Outnumbered_sequential","model":"VDN","rank_in_archive_order":4,"of":11,"metrics":{"Median Win Rate":"15.6"},"uses_additional_data":false},{"leaderboard":"/sota/smac-on-smac-off-complicated-parallel","task":"SMAC+","dataset":"Off_Complicated_parallel","model":"VDN","rank_in_archive_order":2,"of":10,"metrics":{"Median Win Rate":"70.0"},"uses_additional_data":false},{"leaderboard":"/sota/smac-on-smac-off-distant-parallel","task":"SMAC+","dataset":"Off_Distant_parallel","model":"VDN","rank_in_archive_order":2,"of":10,"metrics":{"Median Win Rate":"85.0"},"uses_additional_data":false},{"leaderboard":"/sota/smac-on-smac-off-hard-parallel","task":"SMAC+","dataset":"Off_Hard_parallel","model":"VDN","rank_in_archive_order":2,"of":10,"metrics":{"Median Win Rate":"15.0"},"uses_additional_data":false},{"leaderboard":"/sota/smac-on-smac-off-near-parallel","task":"SMAC+","dataset":"Off_Near_parallel","model":"VDN","rank_in_archive_order":3,"of":10,"metrics":{"Median Win Rate":"90.0"},"uses_additional_data":false},{"leaderboard":"/sota/smac-on-smac-off-superhard-parallel","task":"SMAC+","dataset":"Off_Superhard_parallel","model":"VDN","rank_in_archive_order":6,"of":10,"metrics":{"Median Win Rate":"0.0"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/1706.05296","atlas_url":"https://app.syntology.ai/?focus=1706.05296","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1706.05296"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1706.05296\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1706.05296"},"call":"get_concepts_for_paper(arxiv_id=\"1706.05296\")"}],"by_repo":[{"repo":"Louiii/ValueDecomposition","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"TonghanWang/DOP","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1803.11485"],"harvested_for_calls":[{"arxiv_id":"1803.11485","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1803.11485"},"call":"get_harvested_code_for_paper(arxiv_id=\"1803.11485\")"}]},{"repo":"TonghanWang/NDQ","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1803.11485"],"harvested_for_calls":[{"arxiv_id":"1803.11485","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1803.11485"},"call":"get_harvested_code_for_paper(arxiv_id=\"1803.11485\")"}]},{"repo":"cathyhxh/ctds","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"facebookresearch/benchmarl","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2312.01472"],"harvested_for_calls":[{"arxiv_id":"2312.01472","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2312.01472"},"call":"get_harvested_code_for_paper(arxiv_id=\"2312.01472\")"}]},{"repo":"hhhusiyi-monash/UPDeT","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"jjbong/strangeness_exploration","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"jugg1er/air","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"puyuan1996/MARL","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1803.11485"],"harvested_for_calls":[{"arxiv_id":"1803.11485","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1803.11485"},"call":"get_harvested_code_for_paper(arxiv_id=\"1803.11485\")"}]},{"repo":"tjuhaoxiaotian/pymarl3","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"0cf01462231597b5147b3388c5fce64c92086342e20de7e14ed83fde6645b42a","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}