{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:RO2V26AVRTEA6B3XOANEQL6QYV","short_pith_number":"pith:RO2V26AV","schema_version":"1.0","canonical_sha256":"8bb55d78158cc80f0777701a482fd0c5726a584406ffd0a883e7a752763a468e","source":{"kind":"arxiv","id":"1104.3760","version":1},"attestation_state":"computed","paper":{"title":"Inapproximability of NP-Complete Variants of Nash Equilibrium","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.CC","authors_text":"Eden Chlamtac, Mark Braverman, Per Austrin","submitted_at":"2011-04-19T14:26:03Z","abstract_excerpt":"In recent work of Hazan and Krauthgamer (SICOMP 2011), it was shown that finding an $\\eps$-approximate Nash equilibrium with near-optimal value in a two-player game is as hard as finding a hidden clique of size $O(\\log n)$ in the random graph $G(n,1/2)$. This raises the question of whether a similar intractability holds for approximate Nash equilibrium without such constraints. We give evidence that the constraint of near-optimal value makes the problem distinctly harder: a simple algorithm finds an optimal 1/2-approximate equilibrium, while finding strictly better than 1/2-approximate equilib"},"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":"1104.3760","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-04-19T14:26:03Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"a6cf835e18cb0aa7aa6382323bf8cccee3f2d27e5c0b47c9d0e22f55b5230880","abstract_canon_sha256":"f265026641f34dcd826364d4f54758382a2aa0a3332d9a4389d723d7f941c947"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:23:55.735967Z","signature_b64":"Z7rGGG7eKjEzqMEOdM0+Kn513j9bJl/CO8gvObqSylQcZri/bdmemLqRFnAN7sIZlhbFmb5tqyzQGCeG+oxWCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8bb55d78158cc80f0777701a482fd0c5726a584406ffd0a883e7a752763a468e","last_reissued_at":"2026-05-18T04:23:55.735573Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:23:55.735573Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Inapproximability of NP-Complete Variants of Nash Equilibrium","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.CC","authors_text":"Eden Chlamtac, Mark Braverman, Per Austrin","submitted_at":"2011-04-19T14:26:03Z","abstract_excerpt":"In recent work of Hazan and Krauthgamer (SICOMP 2011), it was shown that finding an $\\eps$-approximate Nash equilibrium with near-optimal value in a two-player game is as hard as finding a hidden clique of size $O(\\log n)$ in the random graph $G(n,1/2)$. This raises the question of whether a similar intractability holds for approximate Nash equilibrium without such constraints. We give evidence that the constraint of near-optimal value makes the problem distinctly harder: a simple algorithm finds an optimal 1/2-approximate equilibrium, while finding strictly better than 1/2-approximate equilib"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.3760","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":"1104.3760","created_at":"2026-05-18T04:23:55.735637+00:00"},{"alias_kind":"arxiv_version","alias_value":"1104.3760v1","created_at":"2026-05-18T04:23:55.735637+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.3760","created_at":"2026-05-18T04:23:55.735637+00:00"},{"alias_kind":"pith_short_12","alias_value":"RO2V26AVRTEA","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_16","alias_value":"RO2V26AVRTEA6B3X","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_8","alias_value":"RO2V26AV","created_at":"2026-05-18T12:26:41.206345+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/RO2V26AVRTEA6B3XOANEQL6QYV","json":"https://pith.science/pith/RO2V26AVRTEA6B3XOANEQL6QYV.json","graph_json":"https://pith.science/api/pith-number/RO2V26AVRTEA6B3XOANEQL6QYV/graph.json","events_json":"https://pith.science/api/pith-number/RO2V26AVRTEA6B3XOANEQL6QYV/events.json","paper":"https://pith.science/paper/RO2V26AV"},"agent_actions":{"view_html":"https://pith.science/pith/RO2V26AVRTEA6B3XOANEQL6QYV","download_json":"https://pith.science/pith/RO2V26AVRTEA6B3XOANEQL6QYV.json","view_paper":"https://pith.science/paper/RO2V26AV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1104.3760&json=true","fetch_graph":"https://pith.science/api/pith-number/RO2V26AVRTEA6B3XOANEQL6QYV/graph.json","fetch_events":"https://pith.science/api/pith-number/RO2V26AVRTEA6B3XOANEQL6QYV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RO2V26AVRTEA6B3XOANEQL6QYV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RO2V26AVRTEA6B3XOANEQL6QYV/action/storage_attestation","attest_author":"https://pith.science/pith/RO2V26AVRTEA6B3XOANEQL6QYV/action/author_attestation","sign_citation":"https://pith.science/pith/RO2V26AVRTEA6B3XOANEQL6QYV/action/citation_signature","submit_replication":"https://pith.science/pith/RO2V26AVRTEA6B3XOANEQL6QYV/action/replication_record"}},"created_at":"2026-05-18T04:23:55.735637+00:00","updated_at":"2026-05-18T04:23:55.735637+00:00"}