{"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":"/method/maddpg","slug":"maddpg","name":"MADDPG","full_name":"MADDPG","full_name_withheld":false,"description_markdown":"**MADDPG**, or **Multi-agent DDPG**, extends [DDPG](https://paperswithcode.com/method/ddpg) into a multi-agent policy gradient algorithm where decentralized agents learn a centralized critic based on the observations and actions of all agents. It leads to learned policies that only use local information (i.e. their own observations) at execution time, does not assume a differentiable model of the environment dynamics or any particular structure on the communication method between agents, and is applicable not only to cooperative interaction but to competitive or mixed interaction involving both physical and communicative behavior. The critic is augmented with extra information about the policies of other agents, while the actor only has access to local information. After training is completed, only the local actors are used at execution phase, acting in a decentralized manner.","description_state":"present","introduced_year":null,"introduced_by":{"title":"Multi-Agent Actor-Critic for Mixed Cooperative-Competitive Environments","paper":"/paper/multi-agent-actor-critic-for-mixed","first_author":"Ryan Lowe","n_authors":6,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/multi-agent-actor-critic-for-mixed"},"source":{"url":"https://arxiv.org/abs/1706.02275v4","title":"Multi-Agent Actor-Critic for Mixed Cooperative-Competitive Environments","url_on_a_paper_host":true},"code_snippet_url":null,"code_snippet_url_on_a_code_host":false,"categories":[{"area":"Reinforcement Learning","area_id":"reinforcement-learning","collection":"Policy Gradient Methods","url":"/methods/category/policy-gradient-methods","pwc_aliases":[]}],"n_papers_tagged":36,"archive_num_papers":36,"papers_newest_first":[{"paper":null,"slug":"fully-decentralized-maddpg-with-networked","title":"Fully-Decentralized MADDPG with Networked Agents","date":"2025-03-09","arxiv_id":"2503.06747","n_code_links":0,"syntology":null},{"paper":null,"slug":"cooperative-multi-agent-deep-reinforcement-4","title":"Cooperative Multi-Agent Deep Reinforcement Learning in Content Ranking Optimization","date":"2024-08-08","arxiv_id":"2408.04251","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-partial-survey-of-decentralized-cooperative","title":"An Initial Introduction to Cooperative Multi-Agent Reinforcement Learning","date":"2024-05-10","arxiv_id":"2405.06161","n_code_links":0,"syntology":null},{"paper":"/paper/combinatorial-client-master-multiagent-deep","slug":"combinatorial-client-master-multiagent-deep","title":"Combinatorial Client-Master Multiagent Deep Reinforcement Learning for Task Offloading in Mobile Edge Computing","date":"2024-02-18","arxiv_id":"2402.11653","n_code_links":2,"syntology":null},{"paper":null,"slug":"privacy-preserving-multi-agent-reinforcement","title":"Privacy Preserving Multi-Agent Reinforcement Learning in Supply Chains","date":"2023-12-09","arxiv_id":"2312.05686","n_code_links":0,"syntology":null},{"paper":null,"slug":"adaptive-resource-management-for-edge-network","title":"Adaptive Resource Management for Edge Network Slicing using Incremental Multi-Agent Deep Reinforcement Learning","date":"2023-10-26","arxiv_id":"2310.17523","n_code_links":0,"syntology":null},{"paper":null,"slug":"safe-hierarchical-reinforcement-learning-for","title":"Safe Hierarchical Reinforcement Learning for CubeSat Task Scheduling Based on Energy Consumption","date":"2023-09-21","arxiv_id":"2309.12004","n_code_links":0,"syntology":null},{"paper":"/paper/progression-cognition-reinforcement-learning","slug":"progression-cognition-reinforcement-learning","title":"Progression Cognition Reinforcement Learning with Prioritized Experience for Multi-Vehicle Pursuit","date":"2023-06-08","arxiv_id":"2306.05016","n_code_links":1,"syntology":null},{"paper":null,"slug":"reinforcement-learning-with-reward-machines","title":"Reinforcement Learning With Reward Machines in Stochastic Games","date":"2023-05-27","arxiv_id":"2305.17372","n_code_links":0,"syntology":null},{"paper":"/paper/revisiting-the-gumbel-softmax-in-maddpg","slug":"revisiting-the-gumbel-softmax-in-maddpg","title":"Revisiting the Gumbel-Softmax in MADDPG","date":"2023-02-23","arxiv_id":"2302.11793","n_code_links":1,"syntology":null},{"paper":null,"slug":"on-multi-agent-deep-deterministic-policy","title":"On Multi-Agent Deep Deterministic Policy Gradients and their Explainability for SMARTS Environment","date":"2023-01-20","arxiv_id":"2301.09420","n_code_links":0,"syntology":null},{"paper":"/paper/multiagent-reinforcement-learning-based-on","slug":"multiagent-reinforcement-learning-based-on","title":"Multiagent Reinforcement Learning Based on Fusion-Multiactor-Attention-Critic for Multiple-Unmanned-Aerial-Vehicle Navigation Control","date":"2022-10-10","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"a-new-approach-to-training-multiple","title":"A New Approach to Training Multiple Cooperative Agents for Autonomous Driving","date":"2022-09-05","arxiv_id":"2209.02157","n_code_links":0,"syntology":null},{"paper":null,"slug":"two-hop-age-of-information-scheduling-for","title":"Two-Hop Age of Information Scheduling for Multi-UAV Assisted Mobile Edge Computing: FRL vs MADDPG","date":"2022-06-19","arxiv_id":"2206.09488","n_code_links":0,"syntology":null},{"paper":null,"slug":"balancing-profit-risk-and-sustainability-for","title":"Balancing Profit, Risk, and Sustainability for Portfolio Management","date":"2022-06-06","arxiv_id":"2207.02134","n_code_links":0,"syntology":null},{"paper":null,"slug":"ma-dreamer-coordination-and-communication","title":"MA-Dreamer: Coordination and communication through shared imagination","date":"2022-04-10","arxiv_id":"2204.04687","n_code_links":0,"syntology":null},{"paper":null,"slug":"decision-making-of-emergent-incident-based-on","title":"Decision-making of Emergent Incident based on P-MADDPG","date":"2022-03-19","arxiv_id":"2203.12673","n_code_links":0,"syntology":null},{"paper":null,"slug":"learning-to-infer-belief-embedded","title":"Learning to Infer Belief Embedded Communication","date":"2022-03-15","arxiv_id":"2203.07832","n_code_links":0,"syntology":null},{"paper":null,"slug":"decentralized-multi-agent-reinforcement-3","title":"Decentralized Multi-Agent Reinforcement Learning: An Off-Policy Method","date":"2021-10-31","arxiv_id":"2111.00438","n_code_links":0,"syntology":null},{"paper":"/paper/trust-region-policy-optimisation-in-multi","slug":"trust-region-policy-optimisation-in-multi","title":"Trust Region Policy Optimisation in Multi-Agent Reinforcement Learning","date":"2021-09-23","arxiv_id":"2109.11251","n_code_links":11,"syntology":{"ran":3,"of":5,"n_ran_checked":1,"n_instrument":2,"unverified":2,"pointer_only":1,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","official":{"repos":["cyanrain7/trust-region-policy-optimisation-in-multi-agent-reinforcement-learning","anonymous-iclr22/trust-region-in-multi-agent-reinforcement-learning"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"paper":"/paper/macrpo-multi-agent-cooperative-recurrent","slug":"macrpo-multi-agent-cooperative-recurrent","title":"MACRPO: Multi-Agent Cooperative Recurrent Policy Optimization","date":"2021-09-02","arxiv_id":"2109.00882","n_code_links":1,"syntology":null},{"paper":null,"slug":"a-deep-reinforcement-learning-approach-for-6","title":"A Deep Reinforcement Learning Approach for Traffic Signal Control Optimization","date":"2021-07-13","arxiv_id":"2107.06115","n_code_links":0,"syntology":null},{"paper":null,"slug":"many-agent-reinforcement-learning-under","title":"Many Agent Reinforcement Learning Under Partial Observability","date":"2021-06-17","arxiv_id":"2106.09825","n_code_links":0,"syntology":null},{"paper":null,"slug":"hierarchical-rnns-based-transformers-maddpg","title":"Hierarchical RNNs-Based Transformers MADDPG for Mixed Cooperative-Competitive Environments","date":"2021-05-11","arxiv_id":"2105.04888","n_code_links":0,"syntology":null},{"paper":null,"slug":"consolidation-via-policy-information","title":"Consolidation via Policy Information Regularization in Deep RL for Multi-Agent Games","date":"2020-11-23","arxiv_id":"2011.11517","n_code_links":0,"syntology":null},{"paper":null,"slug":"human-and-multi-agent-collaboration-in-a","title":"Human and Multi-Agent collaboration in a human-MARL teaming framework","date":"2020-06-12","arxiv_id":"2006.07301","n_code_links":0,"syntology":null},{"paper":null,"slug":"experience-augmentation-boosting-and","title":"Experience Augmentation: Boosting and Accelerating Off-Policy Multi-Agent Reinforcement Learning","date":"2020-05-19","arxiv_id":"2005.09453","n_code_links":0,"syntology":null},{"paper":null,"slug":"multi-agent-reinforcement-learning-for-1","title":"Multi-Agent Reinforcement Learning for Problems with Combined Individual and Team Reward","date":"2020-03-24","arxiv_id":"2003.10598","n_code_links":0,"syntology":null},{"paper":"/paper/evolutionary-population-curriculum-for-1","slug":"evolutionary-population-curriculum-for-1","title":"Evolutionary Population Curriculum for Scaling Multi-Agent Reinforcement Learning","date":"2020-03-23","arxiv_id":"2003.10423","n_code_links":1,"syntology":{"ran":3,"of":3,"n_ran_checked":1,"n_instrument":2,"unverified":0,"pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","official":{"repos":["qian18long/epciclr2020"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/deep-multi-agent-reinforcement-learning-for","slug":"deep-multi-agent-reinforcement-learning-for","title":"FACMAC: Factored Multi-Agent Centralised Policy Gradients","date":"2020-03-14","arxiv_id":"2003.06709","n_code_links":3,"syntology":{"ran":2,"of":4,"n_ran_checked":1,"n_instrument":1,"unverified":2,"pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","official":{"repos":["schroederdewitt/multiagent_mujoco"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"iterative-update-and-unified-representation","title":"Iterative Update and Unified Representation for Multi-Agent Reinforcement Learning","date":"2019-08-16","arxiv_id":"1908.06758","n_code_links":0,"syntology":null},{"paper":null,"slug":"evolutionary-reinforcement-learning-for","title":"Evolutionary Reinforcement Learning for Sample-Efficient Multiagent Coordination","date":"2019-06-18","arxiv_id":"1906.07315","n_code_links":0,"syntology":null},{"paper":"/paper/deep-multi-agent-reinforcement-learning-with","slug":"deep-multi-agent-reinforcement-learning-with","title":"Deep Multi-Agent Reinforcement Learning with Relevance Graphs","date":"2018-11-30","arxiv_id":"1811.12557","n_code_links":1,"syntology":{"ran":1,"of":7,"n_ran_checked":1,"n_instrument":0,"unverified":6,"pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified","official":{"repos":["tegg89/magnet"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":6,"ran_from_kinds":["official"]}}},{"paper":"/paper/do-deep-reinforcement-learning-agents-model","slug":"do-deep-reinforcement-learning-agents-model","title":"Do deep reinforcement learning agents model intentions?","date":"2018-05-15","arxiv_id":"1805.06020","n_code_links":1,"syntology":null},{"paper":null,"slug":"multiagent-soft-q-learning","title":"Multiagent Soft Q-Learning","date":"2018-04-25","arxiv_id":"1804.09817","n_code_links":0,"syntology":null},{"paper":"/paper/multi-agent-actor-critic-for-mixed","slug":"multi-agent-actor-critic-for-mixed","title":"Multi-Agent Actor-Critic for Mixed Cooperative-Competitive Environments","date":"2017-06-07","arxiv_id":"1706.02275","n_code_links":86,"syntology":{"ran":75,"of":143,"n_ran_checked":68,"n_instrument":7,"unverified":68,"pointer_only":99,"phrase":"75 ran (of which 54 constructed an object rather than computing a result; 68 with no instrument failure: 2 honoured, 0 violated, 66 with no contract checked; 7 where Syntology's instrument failed) · 68 unverified","official":{"repos":["openai/multiagent-particle-envs"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","unlocated"]}}}],"papers_shown":36,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":36,"with_a_code_link":11,"where_syntology_ran_a_sample":5,"not_listed_spam_title":0,"listed":36,"listed_where_code_ran":5,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":5,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":5,"listed_every_run_a_failure_of_syntologys_instrument":0,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"papers_where_code_ran":5,"papers_where_code_ran_first_page":"/method/maddpg/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not isolate this method inside it.","pages":[{"order":"ran","page":1,"of":1,"url":"/method/maddpg/papers/ran/1","json":"/method/maddpg/papers/ran/1.json","rows":5}],"tasks":[{"task":"/task/reinforcement-learning-2","name":"reinforcement-learning","papers":25},{"task":"/task/reinforcement-learning","name":"Reinforcement Learning","papers":20},{"task":"/task/multi-agent-reinforcement-learning","name":"Multi-agent Reinforcement Learning","papers":19},{"task":"/task/reinforcement-learning-1","name":"Reinforcement Learning (RL)","papers":19},{"task":"/task/deep-reinforcement-learning","name":"Deep Reinforcement Learning","papers":10},{"task":"/task/q-learning","name":"Q-Learning","papers":8},{"task":"/task/edge-computing","name":"Edge-computing","papers":3},{"task":"/task/mujoco","name":"MuJoCo","papers":3},{"task":"/task/policy-gradient-methods","name":"Policy Gradient Methods","papers":3},{"task":"/task/scheduling","name":"Scheduling","papers":3},{"task":"/task/autonomous-driving","name":"Autonomous Driving","papers":2},{"task":"/task/decision-making","name":"Decision Making","papers":2},{"task":"/task/management","name":"Management","papers":2},{"task":"/task/autonomous-vehicles","name":"Autonomous Vehicles","papers":1},{"task":"/task/benchmarking","name":"Benchmarking","papers":1},{"task":"/task/continual-learning","name":"Continual Learning","papers":1},{"task":"/task/continuous-control","name":"Continuous Control","papers":1},{"task":"/task/face-recognition","name":"Face Recognition","papers":1},{"task":"/task/hierarchical-reinforcement-learning","name":"Hierarchical Reinforcement Learning","papers":1},{"task":"/task/incremental-learning","name":"Incremental Learning","papers":1}],"tasks_shown":20,"n_tasks":36,"usage_by_year":[{"year":"2017","papers":1},{"year":"2018","papers":3},{"year":"2019","papers":2},{"year":"2020","papers":6},{"year":"2021","papers":6},{"year":"2022","papers":7},{"year":"2023","papers":7},{"year":"2024","papers":3},{"year":"2025","papers":1}],"row_source":"methods_table","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/maddpg"},"syntology_read_at":"2026-10-05T00:36:11+00:00","syntology":{"source":"Syntology's have check for this name (the free coverage lookup), read from Syntology's graph","have_url":"https://syntology.ai/api/graph/have?x=MADDPG","read_at":"2026-10-05T00:58:52+00:00","query":"MADDPG","kind":"method","have":"unknown_name","tier":null,"verified_implementation":null,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":null,"resolution":null,"resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":null,"archive_paper_arxiv_id":"1706.02275","repositories":null,"retrieve_with":null,"name_competition":{"verdict":"none","may_be_wrong_sense":false,"bearers_found":0,"served":null,"leading_other_bearer":null,"n_other_bearers_listed":0,"note":"Nothing in this corpus is named 'MADDPG' -- no method node, no paper announcing it in its title, no expanded form declaring it as an acronym."},"name_competition_text":null,"near_matches":["MADDPG-K"],"code_nearby":[],"code_nearby_caption":null,"origin_paper":null,"line":"name not resolved (unknown_name). The lookup matched no method, paper or venue by this name; that asserts nothing about whether code exists.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"51332ec94af41b12e73b93cf78d2ea032ed169722a524d7327beca7c32245e87","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}