{"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/model-based-rl-for-mean-field-games-is-not","title":"Model-Based RL for Mean-Field Games is not Statistically Harder than Single-Agent RL","arxiv_id":"2402.05724","date":"2024-02-08","proceeding":null,"authors":["Jiawei Huang","Niao He","Andreas Krause"],"abstract":"We study the sample complexity of reinforcement learning (RL) in Mean-Field Games (MFGs) with model-based function approximation that requires strategic exploration to find a Nash Equilibrium policy. We introduce the Partial Model-Based Eluder Dimension (P-MBED), a more effective notion to characterize the model class complexity. Notably, P-MBED measures the complexity of the single-agent model class converted from the given mean-field model class, and potentially, can be exponentially lower than the MBED proposed by \\citet{huang2023statistical}. We contribute a model elimination algorithm featuring a novel exploration strategy and establish sample complexity results polynomial w.r.t.~P-MBED. Crucially, our results reveal that, under the basic realizability and Lipschitz continuity assumptions, \\emph{learning Nash Equilibrium in MFGs is no more statistically challenging than solving a logarithmic number of single-agent RL problems}. We further extend our results to Multi-Type MFGs, generalizing from conventional MFGs and involving multiple types of agents. This extension implies statistical tractability of a broader class of Markov Games through the efficacy of mean-field approximation. Finally, inspired by our theoretical algorithm, we present a heuristic approach with improved computational efficiency and empirically demonstrate its effectiveness.","url_abs":"https://arxiv.org/abs/2402.05724v2","url_pdf":"https://arxiv.org/pdf/2402.05724v2.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":"model-based-rl-for-mean-field-games-is-not","repo_url":"https://github.com/jiaweihhuang/heuristic_mebp","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"computational-efficiency","task_name":"Computational Efficiency"},{"task_slug":"reinforcement-learning-1","task_name":"Reinforcement Learning (RL)"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2402.05724","atlas_url":"https://app.syntology.ai/?focus=2402.05724","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.05724"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-25T09:33:49+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":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/jiaweihhuang/heuristic_mebp","reach":null}],"summary":{"ran_draft_wrong":4,"ran_honours":1},"by_repo_kind":{"official":{"samples":5,"ran":5,"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":5,"samples":[{"code_sha256_prefix":"ad4ec8e1b2613d90","entry":"Evaluate_Maximal_Model_Diff_given_RefPolicy","repo":"jiaweihhuang/heuristic_mebp","repo_kind":"official","path":"Algorithm.py","file_url":"https://github.com/jiaweihhuang/heuristic_mebp/blob/HEAD/Algorithm.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"ad4ec8e1b2613d90"}},{"code_sha256_prefix":"9408531f106b5b0c","entry":"ModelElimination","repo":"jiaweihhuang/heuristic_mebp","repo_kind":"official","path":"Algorithm.py","file_url":"https://github.com/jiaweihhuang/heuristic_mebp/blob/HEAD/Algorithm.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"9408531f106b5b0c"}},{"code_sha256_prefix":"905332a873e0add0","entry":"compute_maximal_distance","repo":"jiaweihhuang/heuristic_mebp","repo_kind":"official","path":"Algorithm.py","file_url":"https://github.com/jiaweihhuang/heuristic_mebp/blob/HEAD/Algorithm.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"905332a873e0add0"}},{"code_sha256_prefix":"2c7a97930ee03c81","entry":"policy_diff","repo":"jiaweihhuang/heuristic_mebp","repo_kind":"official","path":"Preparation.py","file_url":"https://github.com/jiaweihhuang/heuristic_mebp/blob/HEAD/Preparation.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"2c7a97930ee03c81"}},{"code_sha256_prefix":"a1b0e4a81082601c","entry":"solve_NE_BR_mixture","repo":"jiaweihhuang/heuristic_mebp","repo_kind":"official","path":"Preparation.py","file_url":"https://github.com/jiaweihhuang/heuristic_mebp/blob/HEAD/Preparation.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"a1b0e4a81082601c"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}