{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:A6DRT4RBWRFPCWSGTAM37VXVWQ","short_pith_number":"pith:A6DRT4RB","schema_version":"1.0","canonical_sha256":"078719f221b44af15a469819bfd6f5b41f7b885150cd03144c16088d90506661","source":{"kind":"arxiv","id":"1711.06318","version":1},"attestation_state":"computed","paper":{"title":"On the Verification and Computation of Strong Nash Equilibrium","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Marco Rocco, Nicola Gatti, Tuomas Sandholm","submitted_at":"2017-11-16T20:56:43Z","abstract_excerpt":"Computing equilibria of games is a central task in computer science. A large number of results are known for \\emph{Nash equilibrium} (NE). However, these can be adopted only when coalitions are not an issue. When instead agents can form coalitions, NE is inadequate and an appropriate solution concept is \\emph{strong Nash equilibrium} (SNE). Few computational results are known about SNE. In this paper, we first study the problem of verifying whether a strategy profile is an SNE, showing that the problem is in $\\mathcal{P}$. We then design a spatial branch--and--bound algorithm to find an SNE, 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":"1711.06318","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-11-16T20:56:43Z","cross_cats_sorted":[],"title_canon_sha256":"fee7455543138e79b863d8e8133ca292c0d9cd716f08de33f756b32666d0bf3b","abstract_canon_sha256":"8c172c7d2931e624519241b2438ca0b31559eda9bdcf5bf885c9347d921b2ccf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:21.469255Z","signature_b64":"YsAhTy1bSFt+eJKu/ooaEJcDn9xz65eNcKoXHXvXOY/8rSn1KgoXd0iChLyOyarXsdlosO0J3Jy5mTSNzk0fCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"078719f221b44af15a469819bfd6f5b41f7b885150cd03144c16088d90506661","last_reissued_at":"2026-05-18T00:30:21.468620Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:21.468620Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Verification and Computation of Strong Nash Equilibrium","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Marco Rocco, Nicola Gatti, Tuomas Sandholm","submitted_at":"2017-11-16T20:56:43Z","abstract_excerpt":"Computing equilibria of games is a central task in computer science. A large number of results are known for \\emph{Nash equilibrium} (NE). However, these can be adopted only when coalitions are not an issue. When instead agents can form coalitions, NE is inadequate and an appropriate solution concept is \\emph{strong Nash equilibrium} (SNE). Few computational results are known about SNE. In this paper, we first study the problem of verifying whether a strategy profile is an SNE, showing that the problem is in $\\mathcal{P}$. We then design a spatial branch--and--bound algorithm to find an SNE, a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.06318","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":"1711.06318","created_at":"2026-05-18T00:30:21.468712+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.06318v1","created_at":"2026-05-18T00:30:21.468712+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.06318","created_at":"2026-05-18T00:30:21.468712+00:00"},{"alias_kind":"pith_short_12","alias_value":"A6DRT4RBWRFP","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"A6DRT4RBWRFPCWSG","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"A6DRT4RB","created_at":"2026-05-18T12:31:05.417338+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/A6DRT4RBWRFPCWSGTAM37VXVWQ","json":"https://pith.science/pith/A6DRT4RBWRFPCWSGTAM37VXVWQ.json","graph_json":"https://pith.science/api/pith-number/A6DRT4RBWRFPCWSGTAM37VXVWQ/graph.json","events_json":"https://pith.science/api/pith-number/A6DRT4RBWRFPCWSGTAM37VXVWQ/events.json","paper":"https://pith.science/paper/A6DRT4RB"},"agent_actions":{"view_html":"https://pith.science/pith/A6DRT4RBWRFPCWSGTAM37VXVWQ","download_json":"https://pith.science/pith/A6DRT4RBWRFPCWSGTAM37VXVWQ.json","view_paper":"https://pith.science/paper/A6DRT4RB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.06318&json=true","fetch_graph":"https://pith.science/api/pith-number/A6DRT4RBWRFPCWSGTAM37VXVWQ/graph.json","fetch_events":"https://pith.science/api/pith-number/A6DRT4RBWRFPCWSGTAM37VXVWQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A6DRT4RBWRFPCWSGTAM37VXVWQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A6DRT4RBWRFPCWSGTAM37VXVWQ/action/storage_attestation","attest_author":"https://pith.science/pith/A6DRT4RBWRFPCWSGTAM37VXVWQ/action/author_attestation","sign_citation":"https://pith.science/pith/A6DRT4RBWRFPCWSGTAM37VXVWQ/action/citation_signature","submit_replication":"https://pith.science/pith/A6DRT4RBWRFPCWSGTAM37VXVWQ/action/replication_record"}},"created_at":"2026-05-18T00:30:21.468712+00:00","updated_at":"2026-05-18T00:30:21.468712+00:00"}