{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:BOG3OV3CNO2RF7HTQ2XYPNZS5U","short_pith_number":"pith:BOG3OV3C","schema_version":"1.0","canonical_sha256":"0b8db757626bb512fcf386af87b732ed1ac176c03526943e33c5f3f344d843fb","source":{"kind":"arxiv","id":"1412.0969","version":1},"attestation_state":"computed","paper":{"title":"Settling Some Open Problems on 2-Player Symmetric Nash Equilibria","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.GT","authors_text":"Ruta Mehta, Sadra Yazdanbod, Vijay V. Vazirani","submitted_at":"2014-12-02T16:40:50Z","abstract_excerpt":"Over the years, researchers have studied the complexity of several decision versions of Nash equilibrium in (symmetric) two-player games (bimatrix games). To the best of our knowledge, the last remaining open problem of this sort is the following; it was stated by Papadimitriou in 2007: find a non-symmetric Nash equilibrium (NE) in a symmetric game. We show that this problem is NP-complete and the problem of counting the number of non-symmetric NE in a symmetric game is #P-complete.\n  In 2005, Kannan and Theobald defined the \"rank of a bimatrix game\" represented by matrices (A, B) to be rank(A"},"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":"1412.0969","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-12-02T16:40:50Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"e0383055a94bdca058b7869e039950471ab843aeef23d246e02a88843c067b69","abstract_canon_sha256":"0aa39c476abdfd13b313ebf64aaf21aeeb6c21952553dc457952ec4d373956fd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:32:15.222663Z","signature_b64":"YZ55GdFwB8cOQmD9CoFEU7+OYvo8gbiGlPW6HgrEYgakH/PrQ48StaaVzvXwO/BZfGc76/lDkYzjzfAHPTUcAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0b8db757626bb512fcf386af87b732ed1ac176c03526943e33c5f3f344d843fb","last_reissued_at":"2026-05-18T02:32:15.221999Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:32:15.221999Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Settling Some Open Problems on 2-Player Symmetric Nash Equilibria","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.GT","authors_text":"Ruta Mehta, Sadra Yazdanbod, Vijay V. Vazirani","submitted_at":"2014-12-02T16:40:50Z","abstract_excerpt":"Over the years, researchers have studied the complexity of several decision versions of Nash equilibrium in (symmetric) two-player games (bimatrix games). To the best of our knowledge, the last remaining open problem of this sort is the following; it was stated by Papadimitriou in 2007: find a non-symmetric Nash equilibrium (NE) in a symmetric game. We show that this problem is NP-complete and the problem of counting the number of non-symmetric NE in a symmetric game is #P-complete.\n  In 2005, Kannan and Theobald defined the \"rank of a bimatrix game\" represented by matrices (A, B) to be rank(A"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.0969","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":"1412.0969","created_at":"2026-05-18T02:32:15.222100+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.0969v1","created_at":"2026-05-18T02:32:15.222100+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.0969","created_at":"2026-05-18T02:32:15.222100+00:00"},{"alias_kind":"pith_short_12","alias_value":"BOG3OV3CNO2R","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_16","alias_value":"BOG3OV3CNO2RF7HT","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_8","alias_value":"BOG3OV3C","created_at":"2026-05-18T12:28:22.404517+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/BOG3OV3CNO2RF7HTQ2XYPNZS5U","json":"https://pith.science/pith/BOG3OV3CNO2RF7HTQ2XYPNZS5U.json","graph_json":"https://pith.science/api/pith-number/BOG3OV3CNO2RF7HTQ2XYPNZS5U/graph.json","events_json":"https://pith.science/api/pith-number/BOG3OV3CNO2RF7HTQ2XYPNZS5U/events.json","paper":"https://pith.science/paper/BOG3OV3C"},"agent_actions":{"view_html":"https://pith.science/pith/BOG3OV3CNO2RF7HTQ2XYPNZS5U","download_json":"https://pith.science/pith/BOG3OV3CNO2RF7HTQ2XYPNZS5U.json","view_paper":"https://pith.science/paper/BOG3OV3C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.0969&json=true","fetch_graph":"https://pith.science/api/pith-number/BOG3OV3CNO2RF7HTQ2XYPNZS5U/graph.json","fetch_events":"https://pith.science/api/pith-number/BOG3OV3CNO2RF7HTQ2XYPNZS5U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BOG3OV3CNO2RF7HTQ2XYPNZS5U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BOG3OV3CNO2RF7HTQ2XYPNZS5U/action/storage_attestation","attest_author":"https://pith.science/pith/BOG3OV3CNO2RF7HTQ2XYPNZS5U/action/author_attestation","sign_citation":"https://pith.science/pith/BOG3OV3CNO2RF7HTQ2XYPNZS5U/action/citation_signature","submit_replication":"https://pith.science/pith/BOG3OV3CNO2RF7HTQ2XYPNZS5U/action/replication_record"}},"created_at":"2026-05-18T02:32:15.222100+00:00","updated_at":"2026-05-18T02:32:15.222100+00:00"}