{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:QXXOMWIYHEJGTEZMSDPKSXG7R6","short_pith_number":"pith:QXXOMWIY","schema_version":"1.0","canonical_sha256":"85eee65918391269932c90dea95cdf8faff0e3c2938fc1b7e20b0edb5b34201a","source":{"kind":"arxiv","id":"1312.7050","version":2},"attestation_state":"computed","paper":{"title":"Nash Equilibrium Computation in Subnetwork Zero-Sum Games with Switching Communications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","math.OC"],"primary_cat":"cs.SY","authors_text":"Guodong Shi, Karl Henrik Johansson, Lihua Xie, Yiguang Hong, Youcheng Lou","submitted_at":"2013-12-26T04:19:12Z","abstract_excerpt":"In this paper, we investigate a distributed Nash equilibrium computation problem for a time-varying multi-agent network consisting of two subnetworks, where the two subnetworks share the same objective function. We first propose a subgradient-based distributed algorithm with heterogeneous stepsizes to compute a Nash equilibrium of a zero-sum game. We then prove that the proposed algorithm can achieve a Nash equilibrium under uniformly jointly strongly connected (UJSC) weight-balanced digraphs with homogenous stepsizes. Moreover, we demonstrate that for weighted-unbalanced graphs a Nash equilib"},"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":"1312.7050","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2013-12-26T04:19:12Z","cross_cats_sorted":["cs.GT","math.OC"],"title_canon_sha256":"dae4a9f240f185fb79d625630a7df466d46ff248f35070670c83420ebbf5af7a","abstract_canon_sha256":"60a95c5ce51c5f08c44534da561896395ff80b69008cbf73f976e91d384f8430"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:55.893874Z","signature_b64":"aUXAbTRGsC5yU+G18mgrdKjd2V8ALitbZR1nOEcu0k1CDdwniMm/dMyCPw3ZTZua5ZyK3oCy+K7Nktg3lEydCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"85eee65918391269932c90dea95cdf8faff0e3c2938fc1b7e20b0edb5b34201a","last_reissued_at":"2026-05-18T01:25:55.893076Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:55.893076Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nash Equilibrium Computation in Subnetwork Zero-Sum Games with Switching Communications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","math.OC"],"primary_cat":"cs.SY","authors_text":"Guodong Shi, Karl Henrik Johansson, Lihua Xie, Yiguang Hong, Youcheng Lou","submitted_at":"2013-12-26T04:19:12Z","abstract_excerpt":"In this paper, we investigate a distributed Nash equilibrium computation problem for a time-varying multi-agent network consisting of two subnetworks, where the two subnetworks share the same objective function. We first propose a subgradient-based distributed algorithm with heterogeneous stepsizes to compute a Nash equilibrium of a zero-sum game. We then prove that the proposed algorithm can achieve a Nash equilibrium under uniformly jointly strongly connected (UJSC) weight-balanced digraphs with homogenous stepsizes. Moreover, we demonstrate that for weighted-unbalanced graphs a Nash equilib"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.7050","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":"1312.7050","created_at":"2026-05-18T01:25:55.893198+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.7050v2","created_at":"2026-05-18T01:25:55.893198+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.7050","created_at":"2026-05-18T01:25:55.893198+00:00"},{"alias_kind":"pith_short_12","alias_value":"QXXOMWIYHEJG","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_16","alias_value":"QXXOMWIYHEJGTEZM","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_8","alias_value":"QXXOMWIY","created_at":"2026-05-18T12:27:57.521954+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/QXXOMWIYHEJGTEZMSDPKSXG7R6","json":"https://pith.science/pith/QXXOMWIYHEJGTEZMSDPKSXG7R6.json","graph_json":"https://pith.science/api/pith-number/QXXOMWIYHEJGTEZMSDPKSXG7R6/graph.json","events_json":"https://pith.science/api/pith-number/QXXOMWIYHEJGTEZMSDPKSXG7R6/events.json","paper":"https://pith.science/paper/QXXOMWIY"},"agent_actions":{"view_html":"https://pith.science/pith/QXXOMWIYHEJGTEZMSDPKSXG7R6","download_json":"https://pith.science/pith/QXXOMWIYHEJGTEZMSDPKSXG7R6.json","view_paper":"https://pith.science/paper/QXXOMWIY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.7050&json=true","fetch_graph":"https://pith.science/api/pith-number/QXXOMWIYHEJGTEZMSDPKSXG7R6/graph.json","fetch_events":"https://pith.science/api/pith-number/QXXOMWIYHEJGTEZMSDPKSXG7R6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QXXOMWIYHEJGTEZMSDPKSXG7R6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QXXOMWIYHEJGTEZMSDPKSXG7R6/action/storage_attestation","attest_author":"https://pith.science/pith/QXXOMWIYHEJGTEZMSDPKSXG7R6/action/author_attestation","sign_citation":"https://pith.science/pith/QXXOMWIYHEJGTEZMSDPKSXG7R6/action/citation_signature","submit_replication":"https://pith.science/pith/QXXOMWIYHEJGTEZMSDPKSXG7R6/action/replication_record"}},"created_at":"2026-05-18T01:25:55.893198+00:00","updated_at":"2026-05-18T01:25:55.893198+00:00"}