{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:F4VKEYX765ZK6E6VEEJDK7CCSM","short_pith_number":"pith:F4VKEYX7","schema_version":"1.0","canonical_sha256":"2f2aa262fff772af13d52112357c4293193b38322966be7cd68c232d57bb3325","source":{"kind":"arxiv","id":"2108.02144","version":1},"attestation_state":"computed","paper":{"title":"No-regret distributed learning in subnetwork zero-sum games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jie Chen, Jinlong Lei, Shijie Huang, Uday V. Shanbhag, Yiguang Hong","submitted_at":"2021-08-04T16:15:32Z","abstract_excerpt":"In this paper, we consider a distributed learning problem in a subnetwork zero-sum game, where agents are competing in different subnetworks. These agents are connected through time-varying graphs where each agent has its own cost function and can receive information from its neighbors. We propose a distributed mirror descent algorithm for computing a Nash equilibrium and establish a sublinear regret bound on the sequence of iterates when the graphs are uniformly strongly connected and the cost functions are convex-concave. Moreover, we prove its convergence with suitably selected diminishing "},"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":"2108.02144","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-08-04T16:15:32Z","cross_cats_sorted":[],"title_canon_sha256":"b013eab58a03a769aa515a17cee852ea409659debf7f167781c5091d2bdf7a74","abstract_canon_sha256":"9a924ce2467d778094e62a43517127d66117241254e6be55a3d43e4df905a147"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:03:22.035865Z","signature_b64":"piylu7Nrsaqqvy2n21oDMcrGt5mLENKLVxMLHZ8eTlbhi38Up8pjg95K9Q03HvzgBRwpizlyOe9mAp7Glk+EBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2f2aa262fff772af13d52112357c4293193b38322966be7cd68c232d57bb3325","last_reissued_at":"2026-07-05T03:03:22.035424Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:03:22.035424Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"No-regret distributed learning in subnetwork zero-sum games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jie Chen, Jinlong Lei, Shijie Huang, Uday V. Shanbhag, Yiguang Hong","submitted_at":"2021-08-04T16:15:32Z","abstract_excerpt":"In this paper, we consider a distributed learning problem in a subnetwork zero-sum game, where agents are competing in different subnetworks. These agents are connected through time-varying graphs where each agent has its own cost function and can receive information from its neighbors. We propose a distributed mirror descent algorithm for computing a Nash equilibrium and establish a sublinear regret bound on the sequence of iterates when the graphs are uniformly strongly connected and the cost functions are convex-concave. Moreover, we prove its convergence with suitably selected diminishing "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2108.02144","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2108.02144/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2108.02144","created_at":"2026-07-05T03:03:22.035487+00:00"},{"alias_kind":"arxiv_version","alias_value":"2108.02144v1","created_at":"2026-07-05T03:03:22.035487+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2108.02144","created_at":"2026-07-05T03:03:22.035487+00:00"},{"alias_kind":"pith_short_12","alias_value":"F4VKEYX765ZK","created_at":"2026-07-05T03:03:22.035487+00:00"},{"alias_kind":"pith_short_16","alias_value":"F4VKEYX765ZK6E6V","created_at":"2026-07-05T03:03:22.035487+00:00"},{"alias_kind":"pith_short_8","alias_value":"F4VKEYX7","created_at":"2026-07-05T03:03:22.035487+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/F4VKEYX765ZK6E6VEEJDK7CCSM","json":"https://pith.science/pith/F4VKEYX765ZK6E6VEEJDK7CCSM.json","graph_json":"https://pith.science/api/pith-number/F4VKEYX765ZK6E6VEEJDK7CCSM/graph.json","events_json":"https://pith.science/api/pith-number/F4VKEYX765ZK6E6VEEJDK7CCSM/events.json","paper":"https://pith.science/paper/F4VKEYX7"},"agent_actions":{"view_html":"https://pith.science/pith/F4VKEYX765ZK6E6VEEJDK7CCSM","download_json":"https://pith.science/pith/F4VKEYX765ZK6E6VEEJDK7CCSM.json","view_paper":"https://pith.science/paper/F4VKEYX7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2108.02144&json=true","fetch_graph":"https://pith.science/api/pith-number/F4VKEYX765ZK6E6VEEJDK7CCSM/graph.json","fetch_events":"https://pith.science/api/pith-number/F4VKEYX765ZK6E6VEEJDK7CCSM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F4VKEYX765ZK6E6VEEJDK7CCSM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F4VKEYX765ZK6E6VEEJDK7CCSM/action/storage_attestation","attest_author":"https://pith.science/pith/F4VKEYX765ZK6E6VEEJDK7CCSM/action/author_attestation","sign_citation":"https://pith.science/pith/F4VKEYX765ZK6E6VEEJDK7CCSM/action/citation_signature","submit_replication":"https://pith.science/pith/F4VKEYX765ZK6E6VEEJDK7CCSM/action/replication_record"}},"created_at":"2026-07-05T03:03:22.035487+00:00","updated_at":"2026-07-05T03:03:22.035487+00:00"}