{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:5IEOJOPIKZ6BLWIVHF2SRKS52I","short_pith_number":"pith:5IEOJOPI","schema_version":"1.0","canonical_sha256":"ea08e4b9e8567c15d915397528aa5dd215749d36de8265b57d8498a430945d41","source":{"kind":"arxiv","id":"2202.11147","version":1},"attestation_state":"computed","paper":{"title":"On the Rate of Convergence of Payoff-based Algorithms to Nash Equilibrium in Strongly Monotone Games","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"math.OC","authors_text":"Maryam Kamgarpour, Tatiana Tatarenko","submitted_at":"2022-02-22T19:45:48Z","abstract_excerpt":"We derive the rate of convergence to Nash equilibria for the payoff-based algorithm proposed in \\cite{tat_kam_TAC}. These rates are achieved under the standard assumption of convexity of the game, strong monotonicity and differentiability of the pseudo-gradient. In particular, we show the algorithm achieves $O(\\frac{1}{T})$ in the two-point function evaluating setting and $O(\\frac{1}{\\sqrt{T}})$ in the one-point function evaluation under additional requirement of Lipschitz continuity of the pseudo-gradient. These rates are to our knowledge the best known rates for the corresponding problem cla"},"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":"2202.11147","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.OC","submitted_at":"2022-02-22T19:45:48Z","cross_cats_sorted":["cs.MA"],"title_canon_sha256":"0401938d4cdf156bde72ef678e170e35715641294ef330b5230d39f305af1d10","abstract_canon_sha256":"fe89dccc5febfe78c31f44760de7bd7466934feec0740c33cf85760adb1e6644"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:59:28.897975Z","signature_b64":"uDcwFjYfdeqhmeeCb4Bs4NjSR/c4iG4CpjozZ7lPywt8WT5ZHan9stWvyyfe9hsuLXCyIb3Lvmw65+xrTRjOCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ea08e4b9e8567c15d915397528aa5dd215749d36de8265b57d8498a430945d41","last_reissued_at":"2026-07-05T03:59:28.897558Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:59:28.897558Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Rate of Convergence of Payoff-based Algorithms to Nash Equilibrium in Strongly Monotone Games","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.MA"],"primary_cat":"math.OC","authors_text":"Maryam Kamgarpour, Tatiana Tatarenko","submitted_at":"2022-02-22T19:45:48Z","abstract_excerpt":"We derive the rate of convergence to Nash equilibria for the payoff-based algorithm proposed in \\cite{tat_kam_TAC}. These rates are achieved under the standard assumption of convexity of the game, strong monotonicity and differentiability of the pseudo-gradient. In particular, we show the algorithm achieves $O(\\frac{1}{T})$ in the two-point function evaluating setting and $O(\\frac{1}{\\sqrt{T}})$ in the one-point function evaluation under additional requirement of Lipschitz continuity of the pseudo-gradient. These rates are to our knowledge the best known rates for the corresponding problem cla"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.11147","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/2202.11147/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":"2202.11147","created_at":"2026-07-05T03:59:28.897620+00:00"},{"alias_kind":"arxiv_version","alias_value":"2202.11147v1","created_at":"2026-07-05T03:59:28.897620+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.11147","created_at":"2026-07-05T03:59:28.897620+00:00"},{"alias_kind":"pith_short_12","alias_value":"5IEOJOPIKZ6B","created_at":"2026-07-05T03:59:28.897620+00:00"},{"alias_kind":"pith_short_16","alias_value":"5IEOJOPIKZ6BLWIV","created_at":"2026-07-05T03:59:28.897620+00:00"},{"alias_kind":"pith_short_8","alias_value":"5IEOJOPI","created_at":"2026-07-05T03:59:28.897620+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.19065","citing_title":"Last-Iterate Guarantees for Learning in Co-coercive Games","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"2604.16087","citing_title":"The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback","ref_index":39,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5IEOJOPIKZ6BLWIVHF2SRKS52I","json":"https://pith.science/pith/5IEOJOPIKZ6BLWIVHF2SRKS52I.json","graph_json":"https://pith.science/api/pith-number/5IEOJOPIKZ6BLWIVHF2SRKS52I/graph.json","events_json":"https://pith.science/api/pith-number/5IEOJOPIKZ6BLWIVHF2SRKS52I/events.json","paper":"https://pith.science/paper/5IEOJOPI"},"agent_actions":{"view_html":"https://pith.science/pith/5IEOJOPIKZ6BLWIVHF2SRKS52I","download_json":"https://pith.science/pith/5IEOJOPIKZ6BLWIVHF2SRKS52I.json","view_paper":"https://pith.science/paper/5IEOJOPI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2202.11147&json=true","fetch_graph":"https://pith.science/api/pith-number/5IEOJOPIKZ6BLWIVHF2SRKS52I/graph.json","fetch_events":"https://pith.science/api/pith-number/5IEOJOPIKZ6BLWIVHF2SRKS52I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5IEOJOPIKZ6BLWIVHF2SRKS52I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5IEOJOPIKZ6BLWIVHF2SRKS52I/action/storage_attestation","attest_author":"https://pith.science/pith/5IEOJOPIKZ6BLWIVHF2SRKS52I/action/author_attestation","sign_citation":"https://pith.science/pith/5IEOJOPIKZ6BLWIVHF2SRKS52I/action/citation_signature","submit_replication":"https://pith.science/pith/5IEOJOPIKZ6BLWIVHF2SRKS52I/action/replication_record"}},"created_at":"2026-07-05T03:59:28.897620+00:00","updated_at":"2026-07-05T03:59:28.897620+00:00"}