{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:AP5F23UJWKDO4HPNZYHK4BALIQ","short_pith_number":"pith:AP5F23UJ","schema_version":"1.0","canonical_sha256":"03fa5d6e89b286ee1dedce0eae040b44343c0c0f905551147bdace016de7b645","source":{"kind":"arxiv","id":"1408.0017","version":1},"attestation_state":"computed","paper":{"title":"Learning Nash Equilibria in Congestion Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.LG","authors_text":"Alexandre M. Bayen, Benjamin Drigh\\`es, Walid Krichene","submitted_at":"2014-07-31T20:10:14Z","abstract_excerpt":"We study the repeated congestion game, in which multiple populations of players share resources, and make, at each iteration, a decentralized decision on which resources to utilize. We investigate the following question: given a model of how individual players update their strategies, does the resulting dynamics of strategy profiles converge to the set of Nash equilibria of the one-shot game? We consider in particular a model in which players update their strategies using algorithms with sublinear discounted regret. We show that the resulting sequence of strategy profiles converges to the set "},"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":"1408.0017","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-07-31T20:10:14Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"2329a03c1327620dc1555160023c9aa5031d7ff37c8959b86d335ede2cbf769f","abstract_canon_sha256":"87c5e4412c15918ed807688a58f96552f0f9b33cdfd8a6bc9e03e7ad9ccd141e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:46:04.069709Z","signature_b64":"+1qU9uu1VTepGalIgxE4Wh5pp8SgTQxAJorCsCU3MVflSQp9VPGWvUEu0sKrec97BX2mbXtc7S0pQogSn2SbDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"03fa5d6e89b286ee1dedce0eae040b44343c0c0f905551147bdace016de7b645","last_reissued_at":"2026-05-18T02:46:04.069126Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:46:04.069126Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning Nash Equilibria in Congestion Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.LG","authors_text":"Alexandre M. Bayen, Benjamin Drigh\\`es, Walid Krichene","submitted_at":"2014-07-31T20:10:14Z","abstract_excerpt":"We study the repeated congestion game, in which multiple populations of players share resources, and make, at each iteration, a decentralized decision on which resources to utilize. We investigate the following question: given a model of how individual players update their strategies, does the resulting dynamics of strategy profiles converge to the set of Nash equilibria of the one-shot game? We consider in particular a model in which players update their strategies using algorithms with sublinear discounted regret. We show that the resulting sequence of strategy profiles converges to the set "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.0017","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":"1408.0017","created_at":"2026-05-18T02:46:04.069215+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.0017v1","created_at":"2026-05-18T02:46:04.069215+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.0017","created_at":"2026-05-18T02:46:04.069215+00:00"},{"alias_kind":"pith_short_12","alias_value":"AP5F23UJWKDO","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_16","alias_value":"AP5F23UJWKDO4HPN","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_8","alias_value":"AP5F23UJ","created_at":"2026-05-18T12:28:19.803747+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AP5F23UJWKDO4HPNZYHK4BALIQ","json":"https://pith.science/pith/AP5F23UJWKDO4HPNZYHK4BALIQ.json","graph_json":"https://pith.science/api/pith-number/AP5F23UJWKDO4HPNZYHK4BALIQ/graph.json","events_json":"https://pith.science/api/pith-number/AP5F23UJWKDO4HPNZYHK4BALIQ/events.json","paper":"https://pith.science/paper/AP5F23UJ"},"agent_actions":{"view_html":"https://pith.science/pith/AP5F23UJWKDO4HPNZYHK4BALIQ","download_json":"https://pith.science/pith/AP5F23UJWKDO4HPNZYHK4BALIQ.json","view_paper":"https://pith.science/paper/AP5F23UJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.0017&json=true","fetch_graph":"https://pith.science/api/pith-number/AP5F23UJWKDO4HPNZYHK4BALIQ/graph.json","fetch_events":"https://pith.science/api/pith-number/AP5F23UJWKDO4HPNZYHK4BALIQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AP5F23UJWKDO4HPNZYHK4BALIQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AP5F23UJWKDO4HPNZYHK4BALIQ/action/storage_attestation","attest_author":"https://pith.science/pith/AP5F23UJWKDO4HPNZYHK4BALIQ/action/author_attestation","sign_citation":"https://pith.science/pith/AP5F23UJWKDO4HPNZYHK4BALIQ/action/citation_signature","submit_replication":"https://pith.science/pith/AP5F23UJWKDO4HPNZYHK4BALIQ/action/replication_record"}},"created_at":"2026-05-18T02:46:04.069215+00:00","updated_at":"2026-05-18T02:46:04.069215+00:00"}