{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:M5FLNCSKZGMBYO7DM3GZPJ7PFO","short_pith_number":"pith:M5FLNCSK","schema_version":"1.0","canonical_sha256":"674ab68a4ac9981c3be366cd97a7ef2b856646d22cce78cba85e7f867895bcbf","source":{"kind":"arxiv","id":"2506.16120","version":1},"attestation_state":"computed","paper":{"title":"Solving Zero-Sum Convex Markov Games","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","cs.MA","math.OC"],"primary_cat":"cs.GT","authors_text":"Emmanouil-Vasileios Vlatakis-Gkaragkounis, Fivos Kalogiannis, Georgios Piliouras, Ian Gemp","submitted_at":"2025-06-19T08:12:02Z","abstract_excerpt":"We contribute the first provable guarantees of global convergence to Nash equilibria (NE) in two-player zero-sum convex Markov games (cMGs) by using independent policy gradient methods. Convex Markov games, recently defined by Gemp et al. (2024), extend Markov decision processes to multi-agent settings with preferences that are convex over occupancy measures, offering a broad framework for modeling generic strategic interactions. However, even the fundamental min-max case of cMGs presents significant challenges, including inherent nonconvexity, the absence of Bellman consistency, and the compl"},"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":"2506.16120","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2025-06-19T08:12:02Z","cross_cats_sorted":["cs.LG","cs.MA","math.OC"],"title_canon_sha256":"ff280556834259b96e280fa3c4f701d67bad85b8114525700ee0b38bd193da1e","abstract_canon_sha256":"614165badfd7a066f53f0324e11e441037fb6d36b3e259cd099a6c7f48ede098"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:24:30.786889Z","signature_b64":"cqC8csq213n4Bw1b0kccWHd3+XOWpvBFPq+bPOla+JLvI6PdU2ADw7zd63yEBG/hRBZBtBQFDc3xI7NzCQCMBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"674ab68a4ac9981c3be366cd97a7ef2b856646d22cce78cba85e7f867895bcbf","last_reissued_at":"2026-07-05T11:24:30.786367Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:24:30.786367Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Solving Zero-Sum Convex Markov Games","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","cs.MA","math.OC"],"primary_cat":"cs.GT","authors_text":"Emmanouil-Vasileios Vlatakis-Gkaragkounis, Fivos Kalogiannis, Georgios Piliouras, Ian Gemp","submitted_at":"2025-06-19T08:12:02Z","abstract_excerpt":"We contribute the first provable guarantees of global convergence to Nash equilibria (NE) in two-player zero-sum convex Markov games (cMGs) by using independent policy gradient methods. Convex Markov games, recently defined by Gemp et al. (2024), extend Markov decision processes to multi-agent settings with preferences that are convex over occupancy measures, offering a broad framework for modeling generic strategic interactions. However, even the fundamental min-max case of cMGs presents significant challenges, including inherent nonconvexity, the absence of Bellman consistency, and the compl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.16120","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/2506.16120/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":"2506.16120","created_at":"2026-07-05T11:24:30.786432+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.16120v1","created_at":"2026-07-05T11:24:30.786432+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.16120","created_at":"2026-07-05T11:24:30.786432+00:00"},{"alias_kind":"pith_short_12","alias_value":"M5FLNCSKZGMB","created_at":"2026-07-05T11:24:30.786432+00:00"},{"alias_kind":"pith_short_16","alias_value":"M5FLNCSKZGMBYO7D","created_at":"2026-07-05T11:24:30.786432+00:00"},{"alias_kind":"pith_short_8","alias_value":"M5FLNCSK","created_at":"2026-07-05T11:24:30.786432+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/M5FLNCSKZGMBYO7DM3GZPJ7PFO","json":"https://pith.science/pith/M5FLNCSKZGMBYO7DM3GZPJ7PFO.json","graph_json":"https://pith.science/api/pith-number/M5FLNCSKZGMBYO7DM3GZPJ7PFO/graph.json","events_json":"https://pith.science/api/pith-number/M5FLNCSKZGMBYO7DM3GZPJ7PFO/events.json","paper":"https://pith.science/paper/M5FLNCSK"},"agent_actions":{"view_html":"https://pith.science/pith/M5FLNCSKZGMBYO7DM3GZPJ7PFO","download_json":"https://pith.science/pith/M5FLNCSKZGMBYO7DM3GZPJ7PFO.json","view_paper":"https://pith.science/paper/M5FLNCSK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.16120&json=true","fetch_graph":"https://pith.science/api/pith-number/M5FLNCSKZGMBYO7DM3GZPJ7PFO/graph.json","fetch_events":"https://pith.science/api/pith-number/M5FLNCSKZGMBYO7DM3GZPJ7PFO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M5FLNCSKZGMBYO7DM3GZPJ7PFO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M5FLNCSKZGMBYO7DM3GZPJ7PFO/action/storage_attestation","attest_author":"https://pith.science/pith/M5FLNCSKZGMBYO7DM3GZPJ7PFO/action/author_attestation","sign_citation":"https://pith.science/pith/M5FLNCSKZGMBYO7DM3GZPJ7PFO/action/citation_signature","submit_replication":"https://pith.science/pith/M5FLNCSKZGMBYO7DM3GZPJ7PFO/action/replication_record"}},"created_at":"2026-07-05T11:24:30.786432+00:00","updated_at":"2026-07-05T11:24:30.786432+00:00"}