{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:SASJDP25VB5SW3WCEVPWZLLPKL","short_pith_number":"pith:SASJDP25","schema_version":"1.0","canonical_sha256":"902491bf5da87b2b6ec2255f6cad6f52c9bf051e4ba5c682f436c6eaa6128b4f","source":{"kind":"arxiv","id":"1608.06580","version":2},"attestation_state":"computed","paper":{"title":"Communication complexity of approximate Nash equilibria","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.GT","authors_text":"Aviad Rubinstein, Yakov Babichenko","submitted_at":"2016-08-23T17:07:52Z","abstract_excerpt":"For a constant $\\epsilon$, we prove a poly(N) lower bound on the (randomized) communication complexity of $\\epsilon$-Nash equilibrium in two-player NxN games. For n-player binary-action games we prove an exp(n) lower bound for the (randomized) communication complexity of $(\\epsilon,\\epsilon)$-weak approximate Nash equilibrium, which is a profile of mixed actions such that at least $(1-\\epsilon)$-fraction of the players are $\\epsilon$-best replying."},"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":"1608.06580","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2016-08-23T17:07:52Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"8a1f23aa5750e22bfce6c803671624cb58241a2cc23cb39592c1278e496e95e6","abstract_canon_sha256":"9cde30c309e1146c5f4cc038a4a2e32adf1be2988c8034546f53d960f2ddd815"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:42.914448Z","signature_b64":"OmQHVkUiRQ27wrDbYX9I80liIv6wQEWGJkZDk7G1e8ui+5Z3ZoSJf2T8A9Wx/mRb3FNfy5tlMKqdCbebiwDvCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"902491bf5da87b2b6ec2255f6cad6f52c9bf051e4ba5c682f436c6eaa6128b4f","last_reissued_at":"2026-05-18T01:04:42.914010Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:42.914010Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Communication complexity of approximate Nash equilibria","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.GT","authors_text":"Aviad Rubinstein, Yakov Babichenko","submitted_at":"2016-08-23T17:07:52Z","abstract_excerpt":"For a constant $\\epsilon$, we prove a poly(N) lower bound on the (randomized) communication complexity of $\\epsilon$-Nash equilibrium in two-player NxN games. For n-player binary-action games we prove an exp(n) lower bound for the (randomized) communication complexity of $(\\epsilon,\\epsilon)$-weak approximate Nash equilibrium, which is a profile of mixed actions such that at least $(1-\\epsilon)$-fraction of the players are $\\epsilon$-best replying."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.06580","kind":"arxiv","version":2},"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":"1608.06580","created_at":"2026-05-18T01:04:42.914071+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.06580v2","created_at":"2026-05-18T01:04:42.914071+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.06580","created_at":"2026-05-18T01:04:42.914071+00:00"},{"alias_kind":"pith_short_12","alias_value":"SASJDP25VB5S","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_16","alias_value":"SASJDP25VB5SW3WC","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_8","alias_value":"SASJDP25","created_at":"2026-05-18T12:30:44.179134+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/SASJDP25VB5SW3WCEVPWZLLPKL","json":"https://pith.science/pith/SASJDP25VB5SW3WCEVPWZLLPKL.json","graph_json":"https://pith.science/api/pith-number/SASJDP25VB5SW3WCEVPWZLLPKL/graph.json","events_json":"https://pith.science/api/pith-number/SASJDP25VB5SW3WCEVPWZLLPKL/events.json","paper":"https://pith.science/paper/SASJDP25"},"agent_actions":{"view_html":"https://pith.science/pith/SASJDP25VB5SW3WCEVPWZLLPKL","download_json":"https://pith.science/pith/SASJDP25VB5SW3WCEVPWZLLPKL.json","view_paper":"https://pith.science/paper/SASJDP25","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.06580&json=true","fetch_graph":"https://pith.science/api/pith-number/SASJDP25VB5SW3WCEVPWZLLPKL/graph.json","fetch_events":"https://pith.science/api/pith-number/SASJDP25VB5SW3WCEVPWZLLPKL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SASJDP25VB5SW3WCEVPWZLLPKL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SASJDP25VB5SW3WCEVPWZLLPKL/action/storage_attestation","attest_author":"https://pith.science/pith/SASJDP25VB5SW3WCEVPWZLLPKL/action/author_attestation","sign_citation":"https://pith.science/pith/SASJDP25VB5SW3WCEVPWZLLPKL/action/citation_signature","submit_replication":"https://pith.science/pith/SASJDP25VB5SW3WCEVPWZLLPKL/action/replication_record"}},"created_at":"2026-05-18T01:04:42.914071+00:00","updated_at":"2026-05-18T01:04:42.914071+00:00"}