{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:LBZH5DPS6UCDJWRW7SXWAWI57Q","short_pith_number":"pith:LBZH5DPS","schema_version":"1.0","canonical_sha256":"58727e8df2f50434da36fcaf60591dfc284ac767afcf04932faa5cc9cd070cf0","source":{"kind":"arxiv","id":"1102.1161","version":1},"attestation_state":"computed","paper":{"title":"The complexity of approximate Nash equilibrium in congestion games with negative delays","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"cs.GT","authors_text":"Frederic Magniez, Michel de Rougemont, Miklos Santha, Xavier Zeitoun","submitted_at":"2011-02-06T15:46:36Z","abstract_excerpt":"We extend the study of the complexity of finding an $\\eps$-approximate Nash equilibrium in congestion games from the case of positive delay functions to delays of arbitrary sign. We first prove that in symmetric games with $\\alpha$-bounded jump the $\\eps$-Nash dynamic converges in polynomial time when all delay functions are negative, similarly to the case of positive delays. We then establish a hardness result for symmetric games with $\\alpha$-bounded jump and with arbitrary delay functions: in that case finding an $\\eps$-Nash equilibrium becomes $\\PLS$-complete."},"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":"1102.1161","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-02-06T15:46:36Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"3e58d01694b4d8564af802ff635b57672e27c186edf48ecba80cc208fd400bb7","abstract_canon_sha256":"5ccf617087b6df4dc59c7adce282e9fb7153e8e80630305f7a5b482e51288c7f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:29:54.888207Z","signature_b64":"IwOD0zyguDfESMOIlTulb864aK3eZkDsNg55WJmhSauN1eRbKQC59CtQqYiMhHlL3jwdStIdny8uIQAhjo/tCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"58727e8df2f50434da36fcaf60591dfc284ac767afcf04932faa5cc9cd070cf0","last_reissued_at":"2026-05-18T04:29:54.887644Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:29:54.887644Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The complexity of approximate Nash equilibrium in congestion games with negative delays","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"cs.GT","authors_text":"Frederic Magniez, Michel de Rougemont, Miklos Santha, Xavier Zeitoun","submitted_at":"2011-02-06T15:46:36Z","abstract_excerpt":"We extend the study of the complexity of finding an $\\eps$-approximate Nash equilibrium in congestion games from the case of positive delay functions to delays of arbitrary sign. We first prove that in symmetric games with $\\alpha$-bounded jump the $\\eps$-Nash dynamic converges in polynomial time when all delay functions are negative, similarly to the case of positive delays. We then establish a hardness result for symmetric games with $\\alpha$-bounded jump and with arbitrary delay functions: in that case finding an $\\eps$-Nash equilibrium becomes $\\PLS$-complete."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.1161","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":"1102.1161","created_at":"2026-05-18T04:29:54.887757+00:00"},{"alias_kind":"arxiv_version","alias_value":"1102.1161v1","created_at":"2026-05-18T04:29:54.887757+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.1161","created_at":"2026-05-18T04:29:54.887757+00:00"},{"alias_kind":"pith_short_12","alias_value":"LBZH5DPS6UCD","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_16","alias_value":"LBZH5DPS6UCDJWRW","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_8","alias_value":"LBZH5DPS","created_at":"2026-05-18T12:26:34.985390+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/LBZH5DPS6UCDJWRW7SXWAWI57Q","json":"https://pith.science/pith/LBZH5DPS6UCDJWRW7SXWAWI57Q.json","graph_json":"https://pith.science/api/pith-number/LBZH5DPS6UCDJWRW7SXWAWI57Q/graph.json","events_json":"https://pith.science/api/pith-number/LBZH5DPS6UCDJWRW7SXWAWI57Q/events.json","paper":"https://pith.science/paper/LBZH5DPS"},"agent_actions":{"view_html":"https://pith.science/pith/LBZH5DPS6UCDJWRW7SXWAWI57Q","download_json":"https://pith.science/pith/LBZH5DPS6UCDJWRW7SXWAWI57Q.json","view_paper":"https://pith.science/paper/LBZH5DPS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1102.1161&json=true","fetch_graph":"https://pith.science/api/pith-number/LBZH5DPS6UCDJWRW7SXWAWI57Q/graph.json","fetch_events":"https://pith.science/api/pith-number/LBZH5DPS6UCDJWRW7SXWAWI57Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LBZH5DPS6UCDJWRW7SXWAWI57Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LBZH5DPS6UCDJWRW7SXWAWI57Q/action/storage_attestation","attest_author":"https://pith.science/pith/LBZH5DPS6UCDJWRW7SXWAWI57Q/action/author_attestation","sign_citation":"https://pith.science/pith/LBZH5DPS6UCDJWRW7SXWAWI57Q/action/citation_signature","submit_replication":"https://pith.science/pith/LBZH5DPS6UCDJWRW7SXWAWI57Q/action/replication_record"}},"created_at":"2026-05-18T04:29:54.887757+00:00","updated_at":"2026-05-18T04:29:54.887757+00:00"}