{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:OKCB7EPTV5TSTTPTMXIRHHYP5C","short_pith_number":"pith:OKCB7EPT","schema_version":"1.0","canonical_sha256":"72841f91f3af6729cdf365d1139f0fe89054ce2584fdb86310c2c9fafc764544","source":{"kind":"arxiv","id":"1306.6686","version":3},"attestation_state":"computed","paper":{"title":"Query Complexity of Approximate Nash Equilibria","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Yakov Babichenko","submitted_at":"2013-06-28T00:56:13Z","abstract_excerpt":"We study the query complexity of approximate notions of Nash equilibrium in games with a large number of players $n$. Our main result states that for $n$-player binary-action games and for constant $\\varepsilon$, the query complexity of an $\\varepsilon$-well-supported Nash equilibrium is exponential in $n$. One of the consequences of this result is an exponential lower bound on the rate of convergence of adaptive dynamics to approxiamte Nash equilibrium."},"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":"1306.6686","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2013-06-28T00:56:13Z","cross_cats_sorted":[],"title_canon_sha256":"64346ad9ca16d5d7d993fd72a86ad69b99556c60f5745aaf80b8affa14638ea2","abstract_canon_sha256":"723ea376ff9cab297a5f30903c1a1daa5773e9ff4b02bc4e4030273de72bea0e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:47:23.191725Z","signature_b64":"Hkae1f8o65nkD7NrK9UpSpqPH7N7E7M8y79FN6fRRNHaIAn0l365BF8uPjqCuy8FYaDXhJT8QOhk4qwGxduHBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"72841f91f3af6729cdf365d1139f0fe89054ce2584fdb86310c2c9fafc764544","last_reissued_at":"2026-05-18T02:47:23.191312Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:47:23.191312Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Query Complexity of Approximate Nash Equilibria","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Yakov Babichenko","submitted_at":"2013-06-28T00:56:13Z","abstract_excerpt":"We study the query complexity of approximate notions of Nash equilibrium in games with a large number of players $n$. Our main result states that for $n$-player binary-action games and for constant $\\varepsilon$, the query complexity of an $\\varepsilon$-well-supported Nash equilibrium is exponential in $n$. One of the consequences of this result is an exponential lower bound on the rate of convergence of adaptive dynamics to approxiamte Nash equilibrium."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.6686","kind":"arxiv","version":3},"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":"1306.6686","created_at":"2026-05-18T02:47:23.191389+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.6686v3","created_at":"2026-05-18T02:47:23.191389+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.6686","created_at":"2026-05-18T02:47:23.191389+00:00"},{"alias_kind":"pith_short_12","alias_value":"OKCB7EPTV5TS","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_16","alias_value":"OKCB7EPTV5TSTTPT","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_8","alias_value":"OKCB7EPT","created_at":"2026-05-18T12:27:54.935989+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/OKCB7EPTV5TSTTPTMXIRHHYP5C","json":"https://pith.science/pith/OKCB7EPTV5TSTTPTMXIRHHYP5C.json","graph_json":"https://pith.science/api/pith-number/OKCB7EPTV5TSTTPTMXIRHHYP5C/graph.json","events_json":"https://pith.science/api/pith-number/OKCB7EPTV5TSTTPTMXIRHHYP5C/events.json","paper":"https://pith.science/paper/OKCB7EPT"},"agent_actions":{"view_html":"https://pith.science/pith/OKCB7EPTV5TSTTPTMXIRHHYP5C","download_json":"https://pith.science/pith/OKCB7EPTV5TSTTPTMXIRHHYP5C.json","view_paper":"https://pith.science/paper/OKCB7EPT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.6686&json=true","fetch_graph":"https://pith.science/api/pith-number/OKCB7EPTV5TSTTPTMXIRHHYP5C/graph.json","fetch_events":"https://pith.science/api/pith-number/OKCB7EPTV5TSTTPTMXIRHHYP5C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OKCB7EPTV5TSTTPTMXIRHHYP5C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OKCB7EPTV5TSTTPTMXIRHHYP5C/action/storage_attestation","attest_author":"https://pith.science/pith/OKCB7EPTV5TSTTPTMXIRHHYP5C/action/author_attestation","sign_citation":"https://pith.science/pith/OKCB7EPTV5TSTTPTMXIRHHYP5C/action/citation_signature","submit_replication":"https://pith.science/pith/OKCB7EPTV5TSTTPTMXIRHHYP5C/action/replication_record"}},"created_at":"2026-05-18T02:47:23.191389+00:00","updated_at":"2026-05-18T02:47:23.191389+00:00"}