{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:USMUCOOZDV4UPPD4O5PXEOUD55","short_pith_number":"pith:USMUCOOZ","schema_version":"1.0","canonical_sha256":"a4994139d91d7947bc7c775f723a83ef766bcbb1418442aac8995704274b2627","source":{"kind":"arxiv","id":"1511.00785","version":1},"attestation_state":"computed","paper":{"title":"Well-Supported versus Approximate Nash Equilibria: Query Complexity of Large Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.GT","authors_text":"Bo Tang, Xi Chen, Yu Cheng","submitted_at":"2015-11-03T05:37:37Z","abstract_excerpt":"We study the randomized query complexity of approximate Nash equilibria (ANE) in large games. We prove that, for some constant $\\epsilon>0$, any randomized oracle algorithm that computes an $\\epsilon$-ANE in a binary-action, $n$-player game must make $2^{\\Omega(n/\\log n)}$ payoff queries. For the stronger solution concept of well-supported Nash equilibria (WSNE), Babichenko previously gave an exponential $2^{\\Omega(n)}$ lower bound for the randomized query complexity of $\\epsilon$-WSNE, for some constant $\\epsilon>0$; the same lower bound was shown to hold for $\\epsilon$-ANE, but only when $\\e"},"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":"1511.00785","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-11-03T05:37:37Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"a4772b46a5254edf99f40de71c86bf97943b122a3e03c2074d5631098407c820","abstract_canon_sha256":"d8ed3821084e32ef8a5a71ee0e63764a38f38025506237138ed25dd6cf2952e8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:27:56.262742Z","signature_b64":"+u8DY7o/WPyvEaDGRbEyxZCt5qfM2NynFW2SQdFz5TEfLjPd9KtEdt/XB8yWckuEpH7Rygoct6rS0rQkLQ7aAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a4994139d91d7947bc7c775f723a83ef766bcbb1418442aac8995704274b2627","last_reissued_at":"2026-05-18T01:27:56.261980Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:27:56.261980Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Well-Supported versus Approximate Nash Equilibria: Query Complexity of Large Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.GT","authors_text":"Bo Tang, Xi Chen, Yu Cheng","submitted_at":"2015-11-03T05:37:37Z","abstract_excerpt":"We study the randomized query complexity of approximate Nash equilibria (ANE) in large games. We prove that, for some constant $\\epsilon>0$, any randomized oracle algorithm that computes an $\\epsilon$-ANE in a binary-action, $n$-player game must make $2^{\\Omega(n/\\log n)}$ payoff queries. For the stronger solution concept of well-supported Nash equilibria (WSNE), Babichenko previously gave an exponential $2^{\\Omega(n)}$ lower bound for the randomized query complexity of $\\epsilon$-WSNE, for some constant $\\epsilon>0$; the same lower bound was shown to hold for $\\epsilon$-ANE, but only when $\\e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.00785","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":"1511.00785","created_at":"2026-05-18T01:27:56.262125+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.00785v1","created_at":"2026-05-18T01:27:56.262125+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.00785","created_at":"2026-05-18T01:27:56.262125+00:00"},{"alias_kind":"pith_short_12","alias_value":"USMUCOOZDV4U","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_16","alias_value":"USMUCOOZDV4UPPD4","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_8","alias_value":"USMUCOOZ","created_at":"2026-05-18T12:29:44.643036+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/USMUCOOZDV4UPPD4O5PXEOUD55","json":"https://pith.science/pith/USMUCOOZDV4UPPD4O5PXEOUD55.json","graph_json":"https://pith.science/api/pith-number/USMUCOOZDV4UPPD4O5PXEOUD55/graph.json","events_json":"https://pith.science/api/pith-number/USMUCOOZDV4UPPD4O5PXEOUD55/events.json","paper":"https://pith.science/paper/USMUCOOZ"},"agent_actions":{"view_html":"https://pith.science/pith/USMUCOOZDV4UPPD4O5PXEOUD55","download_json":"https://pith.science/pith/USMUCOOZDV4UPPD4O5PXEOUD55.json","view_paper":"https://pith.science/paper/USMUCOOZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.00785&json=true","fetch_graph":"https://pith.science/api/pith-number/USMUCOOZDV4UPPD4O5PXEOUD55/graph.json","fetch_events":"https://pith.science/api/pith-number/USMUCOOZDV4UPPD4O5PXEOUD55/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/USMUCOOZDV4UPPD4O5PXEOUD55/action/timestamp_anchor","attest_storage":"https://pith.science/pith/USMUCOOZDV4UPPD4O5PXEOUD55/action/storage_attestation","attest_author":"https://pith.science/pith/USMUCOOZDV4UPPD4O5PXEOUD55/action/author_attestation","sign_citation":"https://pith.science/pith/USMUCOOZDV4UPPD4O5PXEOUD55/action/citation_signature","submit_replication":"https://pith.science/pith/USMUCOOZDV4UPPD4O5PXEOUD55/action/replication_record"}},"created_at":"2026-05-18T01:27:56.262125+00:00","updated_at":"2026-05-18T01:27:56.262125+00:00"}