{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:ALVHQQ24CAJSC32MVD2J2SSZBR","short_pith_number":"pith:ALVHQQ24","schema_version":"1.0","canonical_sha256":"02ea78435c1013216f4ca8f49d4a590c637f0fa4f5ec81d6baba934cef931a52","source":{"kind":"arxiv","id":"1907.10468","version":1},"attestation_state":"computed","paper":{"title":"The Complexity of Computational Problems about Nash Equilibria in Symmetric Win-Lose Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.CC","authors_text":"Marios Mavronicolas, Vittorio Bil\\`o","submitted_at":"2019-07-24T14:42:24Z","abstract_excerpt":"We revisit the complexity of deciding, given a {\\it bimatrix game,} whether it has a {\\it Nash equilibrium} with certain natural properties; such decision problems were early known to be ${\\mathcal{NP}}$-hard~\\cite{GZ89}. We show that ${\\mathcal{NP}}$-hardness still holds under two significant restrictions in simultaneity: the game is {\\it win-lose} (that is, all {\\it utilities} are $0$ or $1$) and {\\it symmetric}. To address the former restriction, we design win-lose {\\it gadgets} and a win-lose reduction; to accomodate the latter restriction, we employ and analyze the classical {\\it ${\\maths"},"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":"1907.10468","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-07-24T14:42:24Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"6a26267eea4f12ef39251dcc2aedd73b81affdf95581003aed7f07efd0603eb5","abstract_canon_sha256":"2b034ced9e55dc7da6446ff2f2328d30307c5efe7294672258651fd2eaaf9f9b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:37.842691Z","signature_b64":"eBnor6xNb+213nNcpOEUsapwGvsRfFwB3F3BFozI6kPH68bUV/hgMkvbfoA5HRLlnruz+rTJQuf02pvs/Tj0Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"02ea78435c1013216f4ca8f49d4a590c637f0fa4f5ec81d6baba934cef931a52","last_reissued_at":"2026-05-17T23:39:37.842173Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:37.842173Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Complexity of Computational Problems about Nash Equilibria in Symmetric Win-Lose Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.CC","authors_text":"Marios Mavronicolas, Vittorio Bil\\`o","submitted_at":"2019-07-24T14:42:24Z","abstract_excerpt":"We revisit the complexity of deciding, given a {\\it bimatrix game,} whether it has a {\\it Nash equilibrium} with certain natural properties; such decision problems were early known to be ${\\mathcal{NP}}$-hard~\\cite{GZ89}. We show that ${\\mathcal{NP}}$-hardness still holds under two significant restrictions in simultaneity: the game is {\\it win-lose} (that is, all {\\it utilities} are $0$ or $1$) and {\\it symmetric}. To address the former restriction, we design win-lose {\\it gadgets} and a win-lose reduction; to accomodate the latter restriction, we employ and analyze the classical {\\it ${\\maths"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.10468","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":"1907.10468","created_at":"2026-05-17T23:39:37.842252+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.10468v1","created_at":"2026-05-17T23:39:37.842252+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.10468","created_at":"2026-05-17T23:39:37.842252+00:00"},{"alias_kind":"pith_short_12","alias_value":"ALVHQQ24CAJS","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"ALVHQQ24CAJSC32M","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"ALVHQQ24","created_at":"2026-05-18T12:33:12.712433+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2104.13097","citing_title":"Minimum Stable Cut and Treewidth","ref_index":14,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ALVHQQ24CAJSC32MVD2J2SSZBR","json":"https://pith.science/pith/ALVHQQ24CAJSC32MVD2J2SSZBR.json","graph_json":"https://pith.science/api/pith-number/ALVHQQ24CAJSC32MVD2J2SSZBR/graph.json","events_json":"https://pith.science/api/pith-number/ALVHQQ24CAJSC32MVD2J2SSZBR/events.json","paper":"https://pith.science/paper/ALVHQQ24"},"agent_actions":{"view_html":"https://pith.science/pith/ALVHQQ24CAJSC32MVD2J2SSZBR","download_json":"https://pith.science/pith/ALVHQQ24CAJSC32MVD2J2SSZBR.json","view_paper":"https://pith.science/paper/ALVHQQ24","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.10468&json=true","fetch_graph":"https://pith.science/api/pith-number/ALVHQQ24CAJSC32MVD2J2SSZBR/graph.json","fetch_events":"https://pith.science/api/pith-number/ALVHQQ24CAJSC32MVD2J2SSZBR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ALVHQQ24CAJSC32MVD2J2SSZBR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ALVHQQ24CAJSC32MVD2J2SSZBR/action/storage_attestation","attest_author":"https://pith.science/pith/ALVHQQ24CAJSC32MVD2J2SSZBR/action/author_attestation","sign_citation":"https://pith.science/pith/ALVHQQ24CAJSC32MVD2J2SSZBR/action/citation_signature","submit_replication":"https://pith.science/pith/ALVHQQ24CAJSC32MVD2J2SSZBR/action/replication_record"}},"created_at":"2026-05-17T23:39:37.842252+00:00","updated_at":"2026-05-17T23:39:37.842252+00:00"}