{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:NGWNRI6MY7V6ODNQ7MO4H6MDDF","short_pith_number":"pith:NGWNRI6M","schema_version":"1.0","canonical_sha256":"69acd8a3ccc7ebe70db0fb1dc3f9831966c1fe35f15e069b5e958eaaab62a944","source":{"kind":"arxiv","id":"2103.00623","version":1},"attestation_state":"computed","paper":{"title":"Scaling up Mean Field Games with Online Mirror Descent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Georgios Piliouras, Julien Perolat, Karl Tuyls, Mathieu Lauri\\`ere, Matthieu Geist, Olivier Pietquin, Romuald Elie, Sarah Perrin","submitted_at":"2021-02-28T21:28:36Z","abstract_excerpt":"We address scaling up equilibrium computation in Mean Field Games (MFGs) using Online Mirror Descent (OMD). We show that continuous-time OMD provably converges to a Nash equilibrium under a natural and well-motivated set of monotonicity assumptions. This theoretical result nicely extends to multi-population games and to settings involving common noise. A thorough experimental investigation on various single and multi-population MFGs shows that OMD outperforms traditional algorithms such as Fictitious Play (FP). We empirically show that OMD scales up and converges significantly faster than FP b"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2103.00623","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2021-02-28T21:28:36Z","cross_cats_sorted":[],"title_canon_sha256":"f1e711eba5f0dd649abd130f0ef7abfd0802d9be99d033734d8329d21f09d03b","abstract_canon_sha256":"7b83a34065fa01425c92eb3e119a706595c17a365a9f51163e4e496b4ac76acb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:19:07.735717Z","signature_b64":"hu9xTf9qrzhNlCraHmxVGA9sw4PzvsExjUc17/txQdL8FZPZqXUDdc4+bFFVZXCfiADp+t1xh6hjdsl/5KVTCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"69acd8a3ccc7ebe70db0fb1dc3f9831966c1fe35f15e069b5e958eaaab62a944","last_reissued_at":"2026-07-05T02:19:07.735197Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:19:07.735197Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scaling up Mean Field Games with Online Mirror Descent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Georgios Piliouras, Julien Perolat, Karl Tuyls, Mathieu Lauri\\`ere, Matthieu Geist, Olivier Pietquin, Romuald Elie, Sarah Perrin","submitted_at":"2021-02-28T21:28:36Z","abstract_excerpt":"We address scaling up equilibrium computation in Mean Field Games (MFGs) using Online Mirror Descent (OMD). We show that continuous-time OMD provably converges to a Nash equilibrium under a natural and well-motivated set of monotonicity assumptions. This theoretical result nicely extends to multi-population games and to settings involving common noise. A thorough experimental investigation on various single and multi-population MFGs shows that OMD outperforms traditional algorithms such as Fictitious Play (FP). We empirically show that OMD scales up and converges significantly faster than FP b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.00623","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2103.00623/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2103.00623","created_at":"2026-07-05T02:19:07.735261+00:00"},{"alias_kind":"arxiv_version","alias_value":"2103.00623v1","created_at":"2026-07-05T02:19:07.735261+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.00623","created_at":"2026-07-05T02:19:07.735261+00:00"},{"alias_kind":"pith_short_12","alias_value":"NGWNRI6MY7V6","created_at":"2026-07-05T02:19:07.735261+00:00"},{"alias_kind":"pith_short_16","alias_value":"NGWNRI6MY7V6ODNQ","created_at":"2026-07-05T02:19:07.735261+00:00"},{"alias_kind":"pith_short_8","alias_value":"NGWNRI6M","created_at":"2026-07-05T02:19:07.735261+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.19611","citing_title":"Bregman-projected mirror methods for regularized stationary mean-field games","ref_index":23,"is_internal_anchor":false},{"citing_arxiv_id":"2509.15103","citing_title":"Vulnerable Agent Identification in Large-Scale Multi-Agent Reinforcement Learning","ref_index":30,"is_internal_anchor":false},{"citing_arxiv_id":"2605.11042","citing_title":"Towards Model-Free Learning in Dynamic Population Games: An Application to Karma Economies","ref_index":28,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NGWNRI6MY7V6ODNQ7MO4H6MDDF","json":"https://pith.science/pith/NGWNRI6MY7V6ODNQ7MO4H6MDDF.json","graph_json":"https://pith.science/api/pith-number/NGWNRI6MY7V6ODNQ7MO4H6MDDF/graph.json","events_json":"https://pith.science/api/pith-number/NGWNRI6MY7V6ODNQ7MO4H6MDDF/events.json","paper":"https://pith.science/paper/NGWNRI6M"},"agent_actions":{"view_html":"https://pith.science/pith/NGWNRI6MY7V6ODNQ7MO4H6MDDF","download_json":"https://pith.science/pith/NGWNRI6MY7V6ODNQ7MO4H6MDDF.json","view_paper":"https://pith.science/paper/NGWNRI6M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2103.00623&json=true","fetch_graph":"https://pith.science/api/pith-number/NGWNRI6MY7V6ODNQ7MO4H6MDDF/graph.json","fetch_events":"https://pith.science/api/pith-number/NGWNRI6MY7V6ODNQ7MO4H6MDDF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NGWNRI6MY7V6ODNQ7MO4H6MDDF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NGWNRI6MY7V6ODNQ7MO4H6MDDF/action/storage_attestation","attest_author":"https://pith.science/pith/NGWNRI6MY7V6ODNQ7MO4H6MDDF/action/author_attestation","sign_citation":"https://pith.science/pith/NGWNRI6MY7V6ODNQ7MO4H6MDDF/action/citation_signature","submit_replication":"https://pith.science/pith/NGWNRI6MY7V6ODNQ7MO4H6MDDF/action/replication_record"}},"created_at":"2026-07-05T02:19:07.735261+00:00","updated_at":"2026-07-05T02:19:07.735261+00:00"}