{"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/a-cooperative-multi-agent-reinforcement","title":"A Cooperative Multi-Agent Reinforcement Learning Framework for Resource Balancing in Complex Logistics Network","arxiv_id":"1903.00714","date":"2019-03-02","proceeding":null,"authors":["Xihan Li","Jia Zhang","Jiang Bian","Yunhai Tong","Tie-Yan Liu"],"abstract":"Resource balancing within complex transportation networks is one of the most\nimportant problems in real logistics domain. Traditional solutions on these\nproblems leverage combinatorial optimization with demand and supply\nforecasting. However, the high complexity of transportation routes, severe\nuncertainty of future demand and supply, together with non-convex business\nconstraints make it extremely challenging in the traditional resource\nmanagement field. In this paper, we propose a novel sophisticated multi-agent\nreinforcement learning approach to address these challenges. In particular,\ninspired by the externalities especially the interactions among resource\nagents, we introduce an innovative cooperative mechanism for state and reward\ndesign resulting in more effective and efficient transportation. Extensive\nexperiments on a simulated ocean transportation service demonstrate that our\nnew approach can stimulate cooperation among agents and lead to much better\nperformance. Compared with traditional solutions based on combinatorial\noptimization, our approach can give rise to a significant improvement in terms\nof both performance and stability.","url_abs":"http://arxiv.org/abs/1903.00714v1","url_pdf":"http://arxiv.org/pdf/1903.00714v1.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":"a-cooperative-multi-agent-reinforcement","repo_url":"https://github.com/microsoft/maro","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"combinatorial-optimization","task_name":"Combinatorial Optimization"},{"task_slug":"management","task_name":"Management"},{"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)"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1903.00714","atlas_url":"https://app.syntology.ai/?focus=1903.00714","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":"1903.00714"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1903.00714\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1903.00714"},"call":"get_concepts_for_paper(arxiv_id=\"1903.00714\")"}],"by_repo":[{"repo":"microsoft/maro","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":"b1e83244bf85b6d05f12c5bcfe173f8df26e9bd9bfa4f56b6239e496c1387015","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}