{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/paper/scalable-mechanism-design-for-multi-agent","title":"Scalable Mechanism Design for Multi-Agent Path Finding","arxiv_id":"2401.17044","date":"2024-01-30","proceeding":null,"authors":["Paul Friedrich","Yulun Zhang","Michael Curry","Ludwig Dierks","Stephen Mcaleer","Jiaoyang Li","Tuomas Sandholm","Sven Seuken"],"abstract":"Multi-Agent Path Finding (MAPF) involves determining paths for multiple agents to travel simultaneously and collision-free through a shared area toward given goal locations. This problem is computationally complex, especially when dealing with large numbers of agents, as is common in realistic applications like autonomous vehicle coordination. Finding an optimal solution is often computationally infeasible, making the use of approximate, suboptimal algorithms essential. Adding to the complexity, agents might act in a self-interested and strategic way, possibly misrepresenting their goals to the MAPF algorithm if it benefits them. Although the field of mechanism design offers tools to align incentives, using these tools without careful consideration can fail when only having access to approximately optimal outcomes. In this work, we introduce the problem of scalable mechanism design for MAPF and propose three strategyproof mechanisms, two of which even use approximate MAPF algorithms. We test our mechanisms on realistic MAPF domains with problem sizes ranging from dozens to hundreds of agents. We find that they improve welfare beyond a simple baseline.","url_abs":"https://arxiv.org/abs/2401.17044v2","url_pdf":"https://arxiv.org/pdf/2401.17044v2.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":"scalable-mechanism-design-for-multi-agent","repo_url":"https://github.com/lunjohnzhang/mapf-mechanism","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok"}}],"tasks":[{"task_slug":"multi-agent-path-finding","task_name":"Multi-Agent Path Finding"}],"methods":[{"method_slug":"align","method_name":"ALIGN"},{"method_slug":null,"method_name":"Travel"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2401.17044","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.17044"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"deterministic:regex_extraction","url":"https://github.com/lunjohnzhang/MAPF-Mechanism","reach":{"status":"ok"}}],"summary":{"ran":3},"by_repo_kind":{"official":{"samples":3,"ran":3,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":3,"samples":[{"code_sha256_prefix":"7aaaa9025161e745","entry":"collect_results","repo":"lunjohnzhang/MAPF-Mechanism","repo_kind":"official","path":"analysis/plot_stats_vs_n_agents.py","file_url":"https://github.com/lunjohnzhang/MAPF-Mechanism/blob/HEAD/analysis/plot_stats_vs_n_agents.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"7aaaa9025161e745"}},{"code_sha256_prefix":"05625ef634d9169b","entry":"get_cost_value_label","repo":"lunjohnzhang/MAPF-Mechanism","repo_kind":"official","path":"analysis/plot_stats_vs_cost_dist.py","file_url":"https://github.com/lunjohnzhang/MAPF-Mechanism/blob/HEAD/analysis/plot_stats_vs_cost_dist.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"05625ef634d9169b"}},{"code_sha256_prefix":"eb5cc2d5bf71d302","entry":"plot_stats_single","repo":"lunjohnzhang/MAPF-Mechanism","repo_kind":"official","path":"analysis/plot_stats_vs_n_agents.py","file_url":"https://github.com/lunjohnzhang/MAPF-Mechanism/blob/HEAD/analysis/plot_stats_vs_n_agents.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"eb5cc2d5bf71d302"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}