{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:6IV3NX4Q2NOR2C2ANZW2M7ECXN","short_pith_number":"pith:6IV3NX4Q","schema_version":"1.0","canonical_sha256":"f22bb6df90d35d1d0b406e6da67c82bb72bd6dccbff862fb32c3e1d9304811e1","source":{"kind":"arxiv","id":"1907.07144","version":1},"attestation_state":"computed","paper":{"title":"Geometric Convergence of Distributed Gradient Play in Games with Unconstrained Action Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Angelia Nedich, Tatiana Tatarenko","submitted_at":"2019-07-15T12:22:46Z","abstract_excerpt":"We provide a distributed algorithm to learn a Nash equilibrium in a class of non-cooperative games with strongly monotone mappings and unconstrained action sets. Each player has access to her own smooth local cost function and can communicate to her neighbors in some undirected graph. We consider a distributed communication-based gradient algorithm. For this procedure, we prove geometric convergence to a Nash equilibrium. In contrast to our previous works [15], [16], where the proposed algorithms required two parameters to be set up and the analysis was based on a so called augmented game mapp"},"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.07144","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-07-15T12:22:46Z","cross_cats_sorted":[],"title_canon_sha256":"fa5fb5e52ff5fc1ceb9170c6b56b80cf11f338aa810869afb4085ca36eaa5e2d","abstract_canon_sha256":"00c7c87df4df2e36d5b203a4648ab9b64b6d9534a5100f2603ba4c1ef2be866c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:27.887348Z","signature_b64":"hTa5EiLyfKuUc/krxaag5iNO3WKoUIWeXJeyT29At2bDVZyFPS71133Wjks2dWyN1lz58xWXZVnMXW70WoApCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f22bb6df90d35d1d0b406e6da67c82bb72bd6dccbff862fb32c3e1d9304811e1","last_reissued_at":"2026-05-17T23:40:27.886542Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:27.886542Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Geometric Convergence of Distributed Gradient Play in Games with Unconstrained Action Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Angelia Nedich, Tatiana Tatarenko","submitted_at":"2019-07-15T12:22:46Z","abstract_excerpt":"We provide a distributed algorithm to learn a Nash equilibrium in a class of non-cooperative games with strongly monotone mappings and unconstrained action sets. Each player has access to her own smooth local cost function and can communicate to her neighbors in some undirected graph. We consider a distributed communication-based gradient algorithm. For this procedure, we prove geometric convergence to a Nash equilibrium. In contrast to our previous works [15], [16], where the proposed algorithms required two parameters to be set up and the analysis was based on a so called augmented game mapp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.07144","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.07144","created_at":"2026-05-17T23:40:27.886685+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.07144v1","created_at":"2026-05-17T23:40:27.886685+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.07144","created_at":"2026-05-17T23:40:27.886685+00:00"},{"alias_kind":"pith_short_12","alias_value":"6IV3NX4Q2NOR","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"6IV3NX4Q2NOR2C2A","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"6IV3NX4Q","created_at":"2026-05-18T12:33:10.108867+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/6IV3NX4Q2NOR2C2ANZW2M7ECXN","json":"https://pith.science/pith/6IV3NX4Q2NOR2C2ANZW2M7ECXN.json","graph_json":"https://pith.science/api/pith-number/6IV3NX4Q2NOR2C2ANZW2M7ECXN/graph.json","events_json":"https://pith.science/api/pith-number/6IV3NX4Q2NOR2C2ANZW2M7ECXN/events.json","paper":"https://pith.science/paper/6IV3NX4Q"},"agent_actions":{"view_html":"https://pith.science/pith/6IV3NX4Q2NOR2C2ANZW2M7ECXN","download_json":"https://pith.science/pith/6IV3NX4Q2NOR2C2ANZW2M7ECXN.json","view_paper":"https://pith.science/paper/6IV3NX4Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.07144&json=true","fetch_graph":"https://pith.science/api/pith-number/6IV3NX4Q2NOR2C2ANZW2M7ECXN/graph.json","fetch_events":"https://pith.science/api/pith-number/6IV3NX4Q2NOR2C2ANZW2M7ECXN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6IV3NX4Q2NOR2C2ANZW2M7ECXN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6IV3NX4Q2NOR2C2ANZW2M7ECXN/action/storage_attestation","attest_author":"https://pith.science/pith/6IV3NX4Q2NOR2C2ANZW2M7ECXN/action/author_attestation","sign_citation":"https://pith.science/pith/6IV3NX4Q2NOR2C2ANZW2M7ECXN/action/citation_signature","submit_replication":"https://pith.science/pith/6IV3NX4Q2NOR2C2ANZW2M7ECXN/action/replication_record"}},"created_at":"2026-05-17T23:40:27.886685+00:00","updated_at":"2026-05-17T23:40:27.886685+00:00"}