{"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/competitive-multi-agent-inverse-reinforcement","title":"Competitive Multi-agent Inverse Reinforcement Learning with Sub-optimal Demonstrations","arxiv_id":"1801.02124","date":"2018-01-07","proceeding":"ICML 2018 7","authors":["Xingyu Wang","Diego Klabjan"],"abstract":"This paper considers the problem of inverse reinforcement learning in\nzero-sum stochastic games when expert demonstrations are known to be not\noptimal. Compared to previous works that decouple agents in the game by\nassuming optimality in expert strategies, we introduce a new objective function\nthat directly pits experts against Nash Equilibrium strategies, and we design\nan algorithm to solve for the reward function in the context of inverse\nreinforcement learning with deep neural networks as model approximations. In\nour setting the model and algorithm do not decouple by agent. In order to find\nNash Equilibrium in large-scale games, we also propose an adversarial training\nalgorithm for zero-sum stochastic games, and show the theoretical appeal of\nnon-existence of local optima in its objective function. In our numerical\nexperiments, we demonstrate that our Nash Equilibrium and inverse reinforcement\nlearning algorithms address games that are not amenable to previous approaches\nusing tabular representations. Moreover, with sub-optimal expert demonstrations\nour algorithms recover both reward functions and strategies with good quality.","url_abs":"http://arxiv.org/abs/1801.02124v2","url_pdf":"http://arxiv.org/pdf/1801.02124v2.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":"competitive-multi-agent-inverse-reinforcement","repo_url":"https://github.com/mdabbah/pacman-rl-project","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"reinforcement-learning","task_name":"Reinforcement Learning"},{"task_slug":"reinforcement-learning-1","task_name":"Reinforcement Learning (RL)"},{"task_slug":"reinforcement-learning-2","task_name":"reinforcement-learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1801.02124","atlas_url":"https://app.syntology.ai/?focus=1801.02124","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":"1801.02124"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1801.02124\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1801.02124"},"call":"get_concepts_for_paper(arxiv_id=\"1801.02124\")"}],"by_repo":[{"repo":"mdabbah/pacman-rl-project","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"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":"c0f390a2b664ec8922931f4f3de3088f8b56d468632225a009d4b170718d94ea","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}