{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:Y67QXTGRXMNEN7RYN2NYUWNVES","short_pith_number":"pith:Y67QXTGR","schema_version":"1.0","canonical_sha256":"c7bf0bccd1bb1a46fe386e9b8a59b5248805e1542f2c430ca5d998fda468c154","source":{"kind":"arxiv","id":"2605.15534","version":1},"attestation_state":"computed","paper":{"title":"Distributionally Robust Nash Equilibrium Seeking with Partial Observations and Distributed Communication","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"Stochastic games admit a nonempty set of distributionally robust Nash equilibria close to standard ones, which inertial dynamics can seek when amicable supergradients exist.","cross_cats":["cs.GT","cs.SY","eess.SY"],"primary_cat":"math.OC","authors_text":"Nirabhra Mandal, Sonia Mart\\'inez","submitted_at":"2026-05-15T02:11:32Z","abstract_excerpt":"In this work, we study stochastic one-shot games where agents' utilities depend on the collective strategy profiles of other agents as well as on some well-behaved randomness. While each decision-maker is agnostic to the random variable's underlying distribution, they have access to finitely many i.i.d. samples generated from it. We consider two cases: one where samples are shared; and another, more special one, where samples are individually accessible. To hedge against the unknown uncertainty, each agent plays a distributionally robust game and aims to maximize the worst-case expected utilit"},"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":true,"formal_links_present":true},"canonical_record":{"source":{"id":"2605.15534","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.OC","submitted_at":"2026-05-15T02:11:32Z","cross_cats_sorted":["cs.GT","cs.SY","eess.SY"],"title_canon_sha256":"10afd5966851b5d1adb5ead69159df660371e860f851dad946c40e282dd98c0e","abstract_canon_sha256":"0850162c47a137651186d259155ed32d7db29c83fe80f917bb624000f42b36d1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:01:03.878275Z","signature_b64":"tlJrap+Lvr0IAd9/rmhzDsXyg9pMKkjOCokE10t/J7/opG3dbBJDiEPuWIRoKleBp3e0c49YTnnKa5+9iEcSBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c7bf0bccd1bb1a46fe386e9b8a59b5248805e1542f2c430ca5d998fda468c154","last_reissued_at":"2026-05-20T00:01:03.877348Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:01:03.877348Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributionally Robust Nash Equilibrium Seeking with Partial Observations and Distributed Communication","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"Stochastic games admit a nonempty set of distributionally robust Nash equilibria close to standard ones, which inertial dynamics can seek when amicable supergradients exist.","cross_cats":["cs.GT","cs.SY","eess.SY"],"primary_cat":"math.OC","authors_text":"Nirabhra Mandal, Sonia Mart\\'inez","submitted_at":"2026-05-15T02:11:32Z","abstract_excerpt":"In this work, we study stochastic one-shot games where agents' utilities depend on the collective strategy profiles of other agents as well as on some well-behaved randomness. While each decision-maker is agnostic to the random variable's underlying distribution, they have access to finitely many i.i.d. samples generated from it. We consider two cases: one where samples are shared; and another, more special one, where samples are individually accessible. To hedge against the unknown uncertainty, each agent plays a distributionally robust game and aims to maximize the worst-case expected utilit"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We provide conditions under which the game has a non-empty set of distributionally robust Nash equilibria (DRoNE) and then characterize the closeness of the DRoNE set to the Nash equilibria (NE) of the associated stochastic game. We then propose an inertial, supported, better response, ascending supergradient dynamics ISBRAG that seeks the DRoNE's when the distributionally robust game possesses what we term as amicable supergradients.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The distributionally robust game possesses amicable supergradients (abstract, paragraph on ISBRAG proposal); if this technical property fails, the proposed dynamics are not guaranteed to seek the DRoNE set.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Provides conditions for non-empty DRoNE sets, characterizes their distance to stochastic NE, and proposes inertial better-response dynamics (ISBRAG) plus a distributed version (d-ISBRAG) for seeking them with partial observations.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Stochastic games admit a nonempty set of distributionally robust Nash equilibria close to standard ones, which inertial dynamics can seek when amicable supergradients exist.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"dae27e72e6cfb911c6f1d67a71874c16060725e41d1f50e9e02a5df40fa5a37e"},"source":{"id":"2605.15534","kind":"arxiv","version":1},"verdict":{"id":"6a0af866-e2f4-4518-b41d-e1c7d70e7988","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T14:51:25.531934Z","strongest_claim":"We provide conditions under which the game has a non-empty set of distributionally robust Nash equilibria (DRoNE) and then characterize the closeness of the DRoNE set to the Nash equilibria (NE) of the associated stochastic game. We then propose an inertial, supported, better response, ascending supergradient dynamics ISBRAG that seeks the DRoNE's when the distributionally robust game possesses what we term as amicable supergradients.","one_line_summary":"Provides conditions for non-empty DRoNE sets, characterizes their distance to stochastic NE, and proposes inertial better-response dynamics (ISBRAG) plus a distributed version (d-ISBRAG) for seeking them with partial observations.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The distributionally robust game possesses amicable supergradients (abstract, paragraph on ISBRAG proposal); if this technical property fails, the proposed dynamics are not guaranteed to seek the DRoNE set.","pith_extraction_headline":"Stochastic games admit a nonempty set of distributionally robust Nash equilibria close to standard ones, which inertial dynamics can seek when amicable supergradients exist."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.15534/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_compliance","ran_at":"2026-05-19T15:10:34.473575Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_title_agreement","ran_at":"2026-05-19T15:01:17.510325Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"cited_work_retraction","ran_at":"2026-05-19T14:22:01.801337Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T14:21:54.033865Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"shingle_duplication","ran_at":"2026-05-19T13:49:41.832700Z","status":"skipped","version":"0.1.0","findings_count":0},{"name":"citation_quote_validity","ran_at":"2026-05-19T13:49:41.369732Z","status":"skipped","version":"0.1.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T13:33:22.618018Z","status":"skipped","version":"1.0.0","findings_count":0}],"snapshot_sha256":"fb3e0e2eb90c5c765404acdeab68c251a671274c337e286ad735369a2a0ba8c4"},"references":{"count":56,"sample":[{"doi":"","year":2010,"title":"T. Basar. Lecture notes on non-cooperative game theory. Game Theory Module of the Graduate Program in Network Mathematics, pages 3–6, 2010","work_id":"4d066a75-a67d-428c-89f8-c502a72ba508","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2014,"title":"Narahari.Game theory and mechanism design, volume 4","work_id":"5cd5525f-6d42-43b7-9bac-1b7ebfce306d","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2009,"title":"J. R. Marden, G. Arslan, and J. S. Shamma. Cooperative control and potential games.IEEE Transactions on Systems, Man, & Cybernetics. Part B: Cybernetics, 39(6):1393–1407, 2009","work_id":"62e27d88-10db-414f-b25d-397173ad9783","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2013,"title":"M. Zhu and S. Martínez. Distributed coverage games for energy-aware mobile sensor networks.SIAM Journal on Control and Optimization, 51(1):1–27, 2013","work_id":"9ae4aee4-a1cb-4a4d-8b2f-96c02ac1963c","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2009,"title":"Y. Pan and L. Pavel. Games with coupled propagated constraints in optical networks with multi-link topologies. Automatica, 45(4):871–880, 2009","work_id":"13e2cadf-b832-44ac-9b75-5fb2dad9484f","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":56,"snapshot_sha256":"f5912355c680b374145ca146d6621ba66672e1299998d3d7015183ebda742bb9","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"f711997557bad35075cc13996204ecc51499cee3981d40af311f01cddd3c9e44"},"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":"2605.15534","created_at":"2026-05-20T00:01:03.877496+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.15534v1","created_at":"2026-05-20T00:01:03.877496+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15534","created_at":"2026-05-20T00:01:03.877496+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y67QXTGRXMNE","created_at":"2026-05-20T00:01:03.877496+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y67QXTGRXMNEN7RY","created_at":"2026-05-20T00:01:03.877496+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y67QXTGR","created_at":"2026-05-20T00:01:03.877496+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":2,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Y67QXTGRXMNEN7RYN2NYUWNVES","json":"https://pith.science/pith/Y67QXTGRXMNEN7RYN2NYUWNVES.json","graph_json":"https://pith.science/api/pith-number/Y67QXTGRXMNEN7RYN2NYUWNVES/graph.json","events_json":"https://pith.science/api/pith-number/Y67QXTGRXMNEN7RYN2NYUWNVES/events.json","paper":"https://pith.science/paper/Y67QXTGR"},"agent_actions":{"view_html":"https://pith.science/pith/Y67QXTGRXMNEN7RYN2NYUWNVES","download_json":"https://pith.science/pith/Y67QXTGRXMNEN7RYN2NYUWNVES.json","view_paper":"https://pith.science/paper/Y67QXTGR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.15534&json=true","fetch_graph":"https://pith.science/api/pith-number/Y67QXTGRXMNEN7RYN2NYUWNVES/graph.json","fetch_events":"https://pith.science/api/pith-number/Y67QXTGRXMNEN7RYN2NYUWNVES/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y67QXTGRXMNEN7RYN2NYUWNVES/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y67QXTGRXMNEN7RYN2NYUWNVES/action/storage_attestation","attest_author":"https://pith.science/pith/Y67QXTGRXMNEN7RYN2NYUWNVES/action/author_attestation","sign_citation":"https://pith.science/pith/Y67QXTGRXMNEN7RYN2NYUWNVES/action/citation_signature","submit_replication":"https://pith.science/pith/Y67QXTGRXMNEN7RYN2NYUWNVES/action/replication_record"}},"created_at":"2026-05-20T00:01:03.877496+00:00","updated_at":"2026-05-20T00:01:03.877496+00:00"}