{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:JUUQ3E2JNTAEC7BMOKEQ7OFMGQ","short_pith_number":"pith:JUUQ3E2J","schema_version":"1.0","canonical_sha256":"4d290d93496cc0417c2c72890fb8ac3405b92a3b9d95241aea6b9d6e4aa539ad","source":{"kind":"arxiv","id":"1810.10891","version":1},"attestation_state":"computed","paper":{"title":"Linearly Convergent Variable Sample-Size Schemes for Stochastic Nash Games: Best-Response Schemes and Distributed Gradient-Response Schemes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jinlong Lei, Uday V. Shanbhag","submitted_at":"2018-10-25T14:25:20Z","abstract_excerpt":"This paper considers an $N$-player stochastic Nash game in which the $i$th player minimizes a composite objective $f_i(x) + r_i(x_i)$, where $f_i$ is expectation-valued and $r_i$ has an efficient prox-evaluation. In this context, we make the following contributions. (i) Under a strong monotonicity assumption on the concatenated gradient map, we derive ({\\bf optimal}) rate statements and oracle complexity bounds for the proposed variable sample-size proximal stochastic gradient-response (VS-PGR) scheme; (ii) We overlay (VS-PGR) with a consensus phase with a view towards developing distributed p"},"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":"1810.10891","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-25T14:25:20Z","cross_cats_sorted":[],"title_canon_sha256":"48e7fb0bc559d023ede9394c4fceb01709df5c9b5ea9f7bff3bc75b9eec8af05","abstract_canon_sha256":"be75b9ffccb3b03dc3858aa51f4ab05c6e860390aa90b71026f4df9d14c699e2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:18.918693Z","signature_b64":"ZckQP6v3354we6W7FMFA+wedlsikjR7hW0ZJcPVggEBi/RhCOEuKrdGrmPi6lAwUZ/WNvGk7G1PovkrdydDiCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4d290d93496cc0417c2c72890fb8ac3405b92a3b9d95241aea6b9d6e4aa539ad","last_reissued_at":"2026-05-18T00:02:18.918099Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:18.918099Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linearly Convergent Variable Sample-Size Schemes for Stochastic Nash Games: Best-Response Schemes and Distributed Gradient-Response Schemes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jinlong Lei, Uday V. Shanbhag","submitted_at":"2018-10-25T14:25:20Z","abstract_excerpt":"This paper considers an $N$-player stochastic Nash game in which the $i$th player minimizes a composite objective $f_i(x) + r_i(x_i)$, where $f_i$ is expectation-valued and $r_i$ has an efficient prox-evaluation. In this context, we make the following contributions. (i) Under a strong monotonicity assumption on the concatenated gradient map, we derive ({\\bf optimal}) rate statements and oracle complexity bounds for the proposed variable sample-size proximal stochastic gradient-response (VS-PGR) scheme; (ii) We overlay (VS-PGR) with a consensus phase with a view towards developing distributed p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.10891","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":"1810.10891","created_at":"2026-05-18T00:02:18.918191+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.10891v1","created_at":"2026-05-18T00:02:18.918191+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.10891","created_at":"2026-05-18T00:02:18.918191+00:00"},{"alias_kind":"pith_short_12","alias_value":"JUUQ3E2JNTAE","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_16","alias_value":"JUUQ3E2JNTAEC7BM","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_8","alias_value":"JUUQ3E2J","created_at":"2026-05-18T12:32:31.084164+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/JUUQ3E2JNTAEC7BMOKEQ7OFMGQ","json":"https://pith.science/pith/JUUQ3E2JNTAEC7BMOKEQ7OFMGQ.json","graph_json":"https://pith.science/api/pith-number/JUUQ3E2JNTAEC7BMOKEQ7OFMGQ/graph.json","events_json":"https://pith.science/api/pith-number/JUUQ3E2JNTAEC7BMOKEQ7OFMGQ/events.json","paper":"https://pith.science/paper/JUUQ3E2J"},"agent_actions":{"view_html":"https://pith.science/pith/JUUQ3E2JNTAEC7BMOKEQ7OFMGQ","download_json":"https://pith.science/pith/JUUQ3E2JNTAEC7BMOKEQ7OFMGQ.json","view_paper":"https://pith.science/paper/JUUQ3E2J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.10891&json=true","fetch_graph":"https://pith.science/api/pith-number/JUUQ3E2JNTAEC7BMOKEQ7OFMGQ/graph.json","fetch_events":"https://pith.science/api/pith-number/JUUQ3E2JNTAEC7BMOKEQ7OFMGQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JUUQ3E2JNTAEC7BMOKEQ7OFMGQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JUUQ3E2JNTAEC7BMOKEQ7OFMGQ/action/storage_attestation","attest_author":"https://pith.science/pith/JUUQ3E2JNTAEC7BMOKEQ7OFMGQ/action/author_attestation","sign_citation":"https://pith.science/pith/JUUQ3E2JNTAEC7BMOKEQ7OFMGQ/action/citation_signature","submit_replication":"https://pith.science/pith/JUUQ3E2JNTAEC7BMOKEQ7OFMGQ/action/replication_record"}},"created_at":"2026-05-18T00:02:18.918191+00:00","updated_at":"2026-05-18T00:02:18.918191+00:00"}