{"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/emergent-complexity-via-multi-agent","title":"Emergent Complexity via Multi-Agent Competition","arxiv_id":"1710.03748","date":"2017-10-10","proceeding":"ICLR 2018 1","authors":["Trapit Bansal","Jakub Pachocki","Szymon Sidor","Ilya Sutskever","Igor Mordatch"],"abstract":"Reinforcement learning algorithms can train agents that solve problems in\ncomplex, interesting environments. Normally, the complexity of the trained\nagent is closely related to the complexity of the environment. This suggests\nthat a highly capable agent requires a complex environment for training. In\nthis paper, we point out that a competitive multi-agent environment trained\nwith self-play can produce behaviors that are far more complex than the\nenvironment itself. We also point out that such environments come with a\nnatural curriculum, because for any skill level, an environment full of agents\nof this level will have the right level of difficulty. This work introduces\nseveral competitive multi-agent environments where agents compete in a 3D world\nwith simulated physics. The trained agents learn a wide variety of complex and\ninteresting skills, even though the environment themselves are relatively\nsimple. The skills include behaviors such as running, blocking, ducking,\ntackling, fooling opponents, kicking, and defending using both arms and legs. A\nhighlight of the learned behaviors can be found here: https://goo.gl/eR7fbX","url_abs":"http://arxiv.org/abs/1710.03748v3","url_pdf":"http://arxiv.org/pdf/1710.03748v3.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":"emergent-complexity-via-multi-agent","repo_url":"https://github.com/openai/multiagent-competition","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"tf","reach":null},{"paper_slug":"emergent-complexity-via-multi-agent","repo_url":"https://github.com/vgudapati/DRLND_Collaboration_Competetion","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}}],"tasks":[{"task_slug":"blocking","task_name":"Blocking"},{"task_slug":"reinforcement-learning","task_name":"Reinforcement Learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1710.03748","atlas_url":"https://app.syntology.ai/?focus=1710.03748","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":"1710.03748"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1710.03748\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1710.03748"},"call":"get_concepts_for_paper(arxiv_id=\"1710.03748\")"}],"by_repo":[{"repo":"openai/multiagent-competition","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2606.12896"],"harvested_for_calls":[{"arxiv_id":"2606.12896","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2606.12896"},"call":"get_harvested_code_for_paper(arxiv_id=\"2606.12896\")"}]},{"repo":"vgudapati/DRLND_Collaboration_Competetion","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":"07c6d8cf1d80203813f39572c3714dedbdf976b75333455bc0d7e77b73f1365f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}