{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:5NLRSSDNDNIM7BPQKVBMUDLDZB","short_pith_number":"pith:5NLRSSDN","schema_version":"1.0","canonical_sha256":"eb5719486d1b50cf85f05542ca0d63c847e216b9b11cb0b6506790fa7acb445b","source":{"kind":"arxiv","id":"2401.09628","version":1},"attestation_state":"computed","paper":{"title":"Polynomial Convergence of Bandit No-Regret Dynamics in Congestion Games","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Ioannis Panageas, Leello Dadi, Luca Viano, Stratis Skoulakis, Volkan Cevher","submitted_at":"2024-01-17T22:37:31Z","abstract_excerpt":"We introduce an online learning algorithm in the bandit feedback model that, once adopted by all agents of a congestion game, results in game-dynamics that converge to an $\\epsilon$-approximate Nash Equilibrium in a polynomial number of rounds with respect to $1/\\epsilon$, the number of players and the number of available resources. The proposed algorithm also guarantees sublinear regret to any agent adopting it. As a result, our work answers an open question from arXiv:2206.01880 and extends the recent results of arXiv:2306.15543 to the bandit feedback model. We additionally establish that ou"},"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":"2401.09628","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2024-01-17T22:37:31Z","cross_cats_sorted":[],"title_canon_sha256":"2f10ab3affff4418c13f4d2d22e3c5278aaed75ca67c230a33251bc7b12edb67","abstract_canon_sha256":"253474bcf6ca78902778ed334861c0c188b50909ae830363120bfbe084fb0623"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:34:59.340679Z","signature_b64":"6v0C433XL7Ka0HpITES6tNkBIYBhzha0MrrfWhAy81pJuUSs8/7Cl8I+CMc9fl+fN6LxE03FM5XOVwOOqtUvCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb5719486d1b50cf85f05542ca0d63c847e216b9b11cb0b6506790fa7acb445b","last_reissued_at":"2026-07-05T07:34:59.340222Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:34:59.340222Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Polynomial Convergence of Bandit No-Regret Dynamics in Congestion Games","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Ioannis Panageas, Leello Dadi, Luca Viano, Stratis Skoulakis, Volkan Cevher","submitted_at":"2024-01-17T22:37:31Z","abstract_excerpt":"We introduce an online learning algorithm in the bandit feedback model that, once adopted by all agents of a congestion game, results in game-dynamics that converge to an $\\epsilon$-approximate Nash Equilibrium in a polynomial number of rounds with respect to $1/\\epsilon$, the number of players and the number of available resources. The proposed algorithm also guarantees sublinear regret to any agent adopting it. As a result, our work answers an open question from arXiv:2206.01880 and extends the recent results of arXiv:2306.15543 to the bandit feedback model. We additionally establish that ou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.09628","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/2401.09628/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":"2401.09628","created_at":"2026-07-05T07:34:59.340281+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.09628v1","created_at":"2026-07-05T07:34:59.340281+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.09628","created_at":"2026-07-05T07:34:59.340281+00:00"},{"alias_kind":"pith_short_12","alias_value":"5NLRSSDNDNIM","created_at":"2026-07-05T07:34:59.340281+00:00"},{"alias_kind":"pith_short_16","alias_value":"5NLRSSDNDNIM7BPQ","created_at":"2026-07-05T07:34:59.340281+00:00"},{"alias_kind":"pith_short_8","alias_value":"5NLRSSDN","created_at":"2026-07-05T07:34:59.340281+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.11791","citing_title":"Robustness of Incentive Mechanisms Against System Misspecification in Congestion Games","ref_index":11,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5NLRSSDNDNIM7BPQKVBMUDLDZB","json":"https://pith.science/pith/5NLRSSDNDNIM7BPQKVBMUDLDZB.json","graph_json":"https://pith.science/api/pith-number/5NLRSSDNDNIM7BPQKVBMUDLDZB/graph.json","events_json":"https://pith.science/api/pith-number/5NLRSSDNDNIM7BPQKVBMUDLDZB/events.json","paper":"https://pith.science/paper/5NLRSSDN"},"agent_actions":{"view_html":"https://pith.science/pith/5NLRSSDNDNIM7BPQKVBMUDLDZB","download_json":"https://pith.science/pith/5NLRSSDNDNIM7BPQKVBMUDLDZB.json","view_paper":"https://pith.science/paper/5NLRSSDN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.09628&json=true","fetch_graph":"https://pith.science/api/pith-number/5NLRSSDNDNIM7BPQKVBMUDLDZB/graph.json","fetch_events":"https://pith.science/api/pith-number/5NLRSSDNDNIM7BPQKVBMUDLDZB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5NLRSSDNDNIM7BPQKVBMUDLDZB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5NLRSSDNDNIM7BPQKVBMUDLDZB/action/storage_attestation","attest_author":"https://pith.science/pith/5NLRSSDNDNIM7BPQKVBMUDLDZB/action/author_attestation","sign_citation":"https://pith.science/pith/5NLRSSDNDNIM7BPQKVBMUDLDZB/action/citation_signature","submit_replication":"https://pith.science/pith/5NLRSSDNDNIM7BPQKVBMUDLDZB/action/replication_record"}},"created_at":"2026-07-05T07:34:59.340281+00:00","updated_at":"2026-07-05T07:34:59.340281+00:00"}