{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:7FN3LRO4GQ6ETSZJHZ3MOQPJ7G","short_pith_number":"pith:7FN3LRO4","schema_version":"1.0","canonical_sha256":"f95bb5c5dc343c49cb293e76c741e9f98080207b57203664123bfb2bf12b6b77","source":{"kind":"arxiv","id":"1407.3004","version":1},"attestation_state":"computed","paper":{"title":"Approximate well-supported Nash equilibria in symmetric bimatrix games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Artur Czumaj, Marcin Jurdzi\\'nski, Michail Fasoulakis","submitted_at":"2014-07-11T01:44:49Z","abstract_excerpt":"The $\\varepsilon$-well-supported Nash equilibrium is a strong notion of approximation of a Nash equilibrium, where no player has an incentive greater than $\\varepsilon$ to deviate from any of the pure strategies that she uses in her mixed strategy. The smallest constant $\\varepsilon$ currently known for which there is a polynomial-time algorithm that computes an $\\varepsilon$-well-supported Nash equilibrium in bimatrix games is slightly below $2/3$. In this paper we study this problem for symmetric bimatrix games and we provide a polynomial-time algorithm that gives a $(1/2+\\delta)$-well-suppo"},"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":"1407.3004","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-07-11T01:44:49Z","cross_cats_sorted":[],"title_canon_sha256":"62d65818028eff8207cbfd1c13e9f1861900005a33454c880890953bb26acac4","abstract_canon_sha256":"a72c5f8f00205dd1e6584ce63c9bbf35454fd0fbb71e0dd7bfca674fa0aebbbf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:47:52.279956Z","signature_b64":"YsU17gr3sAnI+UiVt4FdQ6UHMlL5IGKb2WPk7ALBC836ej3frwjKEqk8NdGOuTEywrV2yHm6dvLdcmal+pUDDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f95bb5c5dc343c49cb293e76c741e9f98080207b57203664123bfb2bf12b6b77","last_reissued_at":"2026-05-18T02:47:52.279408Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:47:52.279408Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximate well-supported Nash equilibria in symmetric bimatrix games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Artur Czumaj, Marcin Jurdzi\\'nski, Michail Fasoulakis","submitted_at":"2014-07-11T01:44:49Z","abstract_excerpt":"The $\\varepsilon$-well-supported Nash equilibrium is a strong notion of approximation of a Nash equilibrium, where no player has an incentive greater than $\\varepsilon$ to deviate from any of the pure strategies that she uses in her mixed strategy. The smallest constant $\\varepsilon$ currently known for which there is a polynomial-time algorithm that computes an $\\varepsilon$-well-supported Nash equilibrium in bimatrix games is slightly below $2/3$. In this paper we study this problem for symmetric bimatrix games and we provide a polynomial-time algorithm that gives a $(1/2+\\delta)$-well-suppo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.3004","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":"1407.3004","created_at":"2026-05-18T02:47:52.279520+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.3004v1","created_at":"2026-05-18T02:47:52.279520+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.3004","created_at":"2026-05-18T02:47:52.279520+00:00"},{"alias_kind":"pith_short_12","alias_value":"7FN3LRO4GQ6E","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_16","alias_value":"7FN3LRO4GQ6ETSZJ","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_8","alias_value":"7FN3LRO4","created_at":"2026-05-18T12:28:16.859392+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/7FN3LRO4GQ6ETSZJHZ3MOQPJ7G","json":"https://pith.science/pith/7FN3LRO4GQ6ETSZJHZ3MOQPJ7G.json","graph_json":"https://pith.science/api/pith-number/7FN3LRO4GQ6ETSZJHZ3MOQPJ7G/graph.json","events_json":"https://pith.science/api/pith-number/7FN3LRO4GQ6ETSZJHZ3MOQPJ7G/events.json","paper":"https://pith.science/paper/7FN3LRO4"},"agent_actions":{"view_html":"https://pith.science/pith/7FN3LRO4GQ6ETSZJHZ3MOQPJ7G","download_json":"https://pith.science/pith/7FN3LRO4GQ6ETSZJHZ3MOQPJ7G.json","view_paper":"https://pith.science/paper/7FN3LRO4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.3004&json=true","fetch_graph":"https://pith.science/api/pith-number/7FN3LRO4GQ6ETSZJHZ3MOQPJ7G/graph.json","fetch_events":"https://pith.science/api/pith-number/7FN3LRO4GQ6ETSZJHZ3MOQPJ7G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7FN3LRO4GQ6ETSZJHZ3MOQPJ7G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7FN3LRO4GQ6ETSZJHZ3MOQPJ7G/action/storage_attestation","attest_author":"https://pith.science/pith/7FN3LRO4GQ6ETSZJHZ3MOQPJ7G/action/author_attestation","sign_citation":"https://pith.science/pith/7FN3LRO4GQ6ETSZJHZ3MOQPJ7G/action/citation_signature","submit_replication":"https://pith.science/pith/7FN3LRO4GQ6ETSZJHZ3MOQPJ7G/action/replication_record"}},"created_at":"2026-05-18T02:47:52.279520+00:00","updated_at":"2026-05-18T02:47:52.279520+00:00"}