{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:PGRGPNZFL2YROP2TX7WDE7HZ54","short_pith_number":"pith:PGRGPNZF","schema_version":"1.0","canonical_sha256":"79a267b7255eb1173f53bfec327cf9ef3968d507c1d1dfeaf667fcc2bee0a28d","source":{"kind":"arxiv","id":"1802.06637","version":1},"attestation_state":"computed","paper":{"title":"On the (in)efficiency of MFG equilibria","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Catherine Rainer (LM), Pierre Cardaliaguet (CEREMADE)","submitted_at":"2018-02-19T14:13:49Z","abstract_excerpt":"Mean field games (MFG) are dynamic games with infinitely many infinitesimal agents. In this context, we study the efficiency of Nash MFG equilibria: Namely, we compare the social cost of a MFG equilibrium with the minimal cost a global planner can achieve. We find a structure condition on the game under which there exists efficient MFG equilibria and, in case this condition is not fulfilled, quantify how inefficient MFG equilibria are."},"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":"1802.06637","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-19T14:13:49Z","cross_cats_sorted":[],"title_canon_sha256":"13ea041f49f7c6353621aa33cdc733d158481ffcd79af75b1baf6e23d7803b4c","abstract_canon_sha256":"e09e09baec029fd269119fdbfb04eefe85a620ac7b6c25ad428ff6dd39f968da"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:02.699010Z","signature_b64":"WMpgeyRYFlRSrIOOXX1nCO97uwzNVEwYFu06haZ5bvOdw+U6+ariwO7nQfIDjcUVDSoRxlMeFRkvoT/NuGf1AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"79a267b7255eb1173f53bfec327cf9ef3968d507c1d1dfeaf667fcc2bee0a28d","last_reissued_at":"2026-05-18T00:23:02.698330Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:02.698330Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the (in)efficiency of MFG equilibria","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Catherine Rainer (LM), Pierre Cardaliaguet (CEREMADE)","submitted_at":"2018-02-19T14:13:49Z","abstract_excerpt":"Mean field games (MFG) are dynamic games with infinitely many infinitesimal agents. In this context, we study the efficiency of Nash MFG equilibria: Namely, we compare the social cost of a MFG equilibrium with the minimal cost a global planner can achieve. We find a structure condition on the game under which there exists efficient MFG equilibria and, in case this condition is not fulfilled, quantify how inefficient MFG equilibria are."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.06637","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":""},"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":"1802.06637","created_at":"2026-05-18T00:23:02.698442+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.06637v1","created_at":"2026-05-18T00:23:02.698442+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.06637","created_at":"2026-05-18T00:23:02.698442+00:00"},{"alias_kind":"pith_short_12","alias_value":"PGRGPNZFL2YR","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"PGRGPNZFL2YROP2T","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"PGRGPNZF","created_at":"2026-05-18T12:32:43.782077+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.09785","citing_title":"An example of multiple mean field limits in ergodic differential games","ref_index":9,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PGRGPNZFL2YROP2TX7WDE7HZ54","json":"https://pith.science/pith/PGRGPNZFL2YROP2TX7WDE7HZ54.json","graph_json":"https://pith.science/api/pith-number/PGRGPNZFL2YROP2TX7WDE7HZ54/graph.json","events_json":"https://pith.science/api/pith-number/PGRGPNZFL2YROP2TX7WDE7HZ54/events.json","paper":"https://pith.science/paper/PGRGPNZF"},"agent_actions":{"view_html":"https://pith.science/pith/PGRGPNZFL2YROP2TX7WDE7HZ54","download_json":"https://pith.science/pith/PGRGPNZFL2YROP2TX7WDE7HZ54.json","view_paper":"https://pith.science/paper/PGRGPNZF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.06637&json=true","fetch_graph":"https://pith.science/api/pith-number/PGRGPNZFL2YROP2TX7WDE7HZ54/graph.json","fetch_events":"https://pith.science/api/pith-number/PGRGPNZFL2YROP2TX7WDE7HZ54/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PGRGPNZFL2YROP2TX7WDE7HZ54/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PGRGPNZFL2YROP2TX7WDE7HZ54/action/storage_attestation","attest_author":"https://pith.science/pith/PGRGPNZFL2YROP2TX7WDE7HZ54/action/author_attestation","sign_citation":"https://pith.science/pith/PGRGPNZFL2YROP2TX7WDE7HZ54/action/citation_signature","submit_replication":"https://pith.science/pith/PGRGPNZFL2YROP2TX7WDE7HZ54/action/replication_record"}},"created_at":"2026-05-18T00:23:02.698442+00:00","updated_at":"2026-05-18T00:23:02.698442+00:00"}