{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:SZPJFPYUMCRLFB4XIS6JZ6H7HV","short_pith_number":"pith:SZPJFPYU","schema_version":"1.0","canonical_sha256":"965e92bf1460a2b2879744bc9cf8ff3d5f37022d819c23a2fb82889eab42b42c","source":{"kind":"arxiv","id":"1102.2280","version":1},"attestation_state":"computed","paper":{"title":"On Oblivious PTAS's for Nash Equilibrium","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.CO"],"primary_cat":"cs.GT","authors_text":"Christos H. Papadimitriou, Constantinos Daskalakis","submitted_at":"2011-02-11T04:42:36Z","abstract_excerpt":"If a game has a Nash equilibrium with probability values that are either zero or Omega(1) then this equilibrium can be found exhaustively in polynomial time. Somewhat surprisingly, we show that there is a PTAS for the games whose equilibria are guaranteed to have small-O(1/n)-values, and therefore large-Omega(n)-supports. We also point out that there is a PTAS for games with sparse payoff matrices, which are known to be PPAD-complete to solve exactly. Both algorithms are of a special kind that we call oblivious: The algorithm just samples a fixed distribution on pairs of mixed strategies, and "},"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.2280","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2011-02-11T04:42:36Z","cross_cats_sorted":["stat.CO"],"title_canon_sha256":"8d6351abe3b3d02cad9b872845ad63b1e02d15df301cc2de00cf34d13033d8ea","abstract_canon_sha256":"314edc41cfde8fb9d6650db49ec385ce1ba933fe20d820ab535ddec2168ecbc8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:28:56.361412Z","signature_b64":"lGm/70/kpjEAd0GMj9na/o7Nvy7bgXqKbv39dg70sCE62L4pulzFMu3a7Hlfmd3oHQzfVRXoAcPy1mddtAFHCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"965e92bf1460a2b2879744bc9cf8ff3d5f37022d819c23a2fb82889eab42b42c","last_reissued_at":"2026-05-18T04:28:56.360958Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:28:56.360958Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Oblivious PTAS's for Nash Equilibrium","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.CO"],"primary_cat":"cs.GT","authors_text":"Christos H. Papadimitriou, Constantinos Daskalakis","submitted_at":"2011-02-11T04:42:36Z","abstract_excerpt":"If a game has a Nash equilibrium with probability values that are either zero or Omega(1) then this equilibrium can be found exhaustively in polynomial time. Somewhat surprisingly, we show that there is a PTAS for the games whose equilibria are guaranteed to have small-O(1/n)-values, and therefore large-Omega(n)-supports. We also point out that there is a PTAS for games with sparse payoff matrices, which are known to be PPAD-complete to solve exactly. Both algorithms are of a special kind that we call oblivious: The algorithm just samples a fixed distribution on pairs of mixed strategies, and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.2280","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.2280","created_at":"2026-05-18T04:28:56.361024+00:00"},{"alias_kind":"arxiv_version","alias_value":"1102.2280v1","created_at":"2026-05-18T04:28:56.361024+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.2280","created_at":"2026-05-18T04:28:56.361024+00:00"},{"alias_kind":"pith_short_12","alias_value":"SZPJFPYUMCRL","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_16","alias_value":"SZPJFPYUMCRLFB4X","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_8","alias_value":"SZPJFPYU","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/SZPJFPYUMCRLFB4XIS6JZ6H7HV","json":"https://pith.science/pith/SZPJFPYUMCRLFB4XIS6JZ6H7HV.json","graph_json":"https://pith.science/api/pith-number/SZPJFPYUMCRLFB4XIS6JZ6H7HV/graph.json","events_json":"https://pith.science/api/pith-number/SZPJFPYUMCRLFB4XIS6JZ6H7HV/events.json","paper":"https://pith.science/paper/SZPJFPYU"},"agent_actions":{"view_html":"https://pith.science/pith/SZPJFPYUMCRLFB4XIS6JZ6H7HV","download_json":"https://pith.science/pith/SZPJFPYUMCRLFB4XIS6JZ6H7HV.json","view_paper":"https://pith.science/paper/SZPJFPYU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1102.2280&json=true","fetch_graph":"https://pith.science/api/pith-number/SZPJFPYUMCRLFB4XIS6JZ6H7HV/graph.json","fetch_events":"https://pith.science/api/pith-number/SZPJFPYUMCRLFB4XIS6JZ6H7HV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SZPJFPYUMCRLFB4XIS6JZ6H7HV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SZPJFPYUMCRLFB4XIS6JZ6H7HV/action/storage_attestation","attest_author":"https://pith.science/pith/SZPJFPYUMCRLFB4XIS6JZ6H7HV/action/author_attestation","sign_citation":"https://pith.science/pith/SZPJFPYUMCRLFB4XIS6JZ6H7HV/action/citation_signature","submit_replication":"https://pith.science/pith/SZPJFPYUMCRLFB4XIS6JZ6H7HV/action/replication_record"}},"created_at":"2026-05-18T04:28:56.361024+00:00","updated_at":"2026-05-18T04:28:56.361024+00:00"}