{"as_of":"2026-08-08T06:19:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:dd0d769ff948a75d4698360502612c8314deb9ef685fa5540dc9b7c38cd90a6b","coverage":[{"denominator":140,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":100,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T23:55:55.632354Z","state":"measured"},{"denominator":100,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":100,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2506.16120/citation-record","integrity":"/paper/2506.16120/integrity","json":"/paper/2506.16120/citation-record.json","paper":"/paper/2506.16120"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:55:55.252158Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.252158Z"},"links":{"citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:5a26a4f0cfb8780b0e2ad97a0c85189cb9a36fe5ca32bc3681895306aecde3ee","observation_id":"d52c36e9-a840-48d2-b029-8bf780861f8c","resolution":{"observed_at":"2026-08-06T23:55:55.252158Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:55:55.257996Z","title":"Ho, Michael Littman, Doina Precup, and Satinder Singh","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.257996Z"},"links":{"citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:1e2926d09f5f5b6106f277dd004c369072fa4185295bdbf8e531cb40e4ad1aa5","observation_id":"2d8a3780-4521-4f42-98ca-4159c42061e3","resolution":{"observed_at":"2026-08-06T23:55:55.257996Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:55:55.262898Z","title":"Theory of maxima and the method of lagrange","venue":null,"work_id":null,"year":1971},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.262898Z"},"links":{"citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:1965e2ac26f61a2d36f0fb71fdf0376c05520f99fb203a1efbb0b7092828a88f","observation_id":"6dc0a3cf-7f03-494d-98d7-42804e36fb09","resolution":{"observed_at":"2026-08-06T23:55:55.262898Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/23m1580218","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:55:55.943984Z","title":"The rate of convergence of bregman proximal methods: Local geometry versus regularity versus sharpness","venue":null,"work_id":"6f43bac6-7079-4e46-86fd-75dfbb886781","year":2024},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.266632Z"},"links":{"citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:283535e36e953839cf288a2331329a9ada5fe5cd782257c2e1112d3829fdb392","observation_id":"0341e1a1-878d-4832-9cbf-9789abe6e1de","resolution":{"observed_at":"2026-08-06T23:55:55.954951Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:55:55.270701Z","title":"Provable self-play algorithms for competitive reinforcement learning","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.270701Z"},"links":{"citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:01ea694948a28599a68464ab0242449face153b5d1d4a4b87567de03c7852386","observation_id":"0a0ab338-ff42-440e-8d76-b225e41bf1d5","resolution":{"observed_at":"2026-08-06T23:55:55.270701Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:55:55.274649Z","title":"Multiplicative weights update in zero-sum games","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.274649Z"},"links":{"citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:23bfdb12944adf1ba0e4f073b863476bbcacc9bfa75c3715b90f3c55af2f76ca","observation_id":"e37b4d30-3662-4b5b-aa5f-c50aac10beb7","resolution":{"observed_at":"2026-08-06T23:55:55.274649Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:55:55.278382Z","title":"Finite regret and cycles with fixed step-size via alternating gradient descent-ascent","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.278382Z"},"links":{"citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:c214daa449ad58c5c772ab2d99ff066bbeb9a6037af082050e712dc130058856","observation_id":"0f8eed09-b376-404d-bd1a-e97fb99fd324","resolution":{"observed_at":"2026-08-06T23:55:55.278382Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.05492","last_updated":"2022-10-11T14:47:35Z","snapshot_observed_at":"2026-07-06T14:03:42.001135Z","submitted_at":"2022-10-11T14:47:35Z","title":"Mastering the Game of No-Press Diplomacy via Human-Regularized Reinforcement Learning and Planning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.05492","snapshot_observed_at":"2026-08-06T23:55:55.282546Z","title":"Mastering the game of no-press diplomacy via human-regularized reinforcement learning and planning","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.282546Z"},"links":{"cited_paper":"/paper/2210.05492","citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:5057ab701c97be667641cba822562ed924fd113c006a7c7712f715e1931aeeee","observation_id":"3efe868b-18c8-4c93-a434-f0f212b61fed","resolution":{"observed_at":"2026-08-06T23:55:55.282546Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:55:55.286389Z","title":"Reinforcement learning with general utilities: Simpler variance reduction and large state-action space","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.286389Z"},"links":{"citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:c83e43b631281b985018747bd7d20c1497a866b19f803e64ddc3bc4df5eb2528","observation_id":"fe8cff65-0809-443c-89d3-fb5eb150c1aa","resolution":{"observed_at":"2026-08-06T23:55:55.286389Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:55:55.289933Z","title":"Bauschke and Patrick L","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.289933Z"},"links":{"citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:7a6ff7317b500fdfceb78f9c447c79b2b5103b448b8cad8fc2d10e51b3dece22","observation_id":"51558166-fc07-4a72-b252-801e6b32e2ab","resolution":{"observed_at":"2026-08-06T23:55:55.289933Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:55:55.294077Z","title":"Dynamic programming and stochastic control processes","venue":null,"work_id":null,"year":1958},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.294077Z"},"links":{"citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:f2415da729388c7a8ebf2ffc096ca99dfb59f45f6442e3a5cc790d1ab7a72973","observation_id":"90375c2a-a27c-4dad-911b-ec70060cdf52","resolution":{"observed_at":"2026-08-06T23:55:55.294077Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:55:55.298745Z","title":"Hidden convexity in some nonconvex quadratically constrained quadratic programming","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.298745Z"},"links":{"citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:0311cd0555bf9c0dc2bad571f9dab11a6bed9988cfa682518f531234aa77fa80","observation_id":"52a3d114-a491-4d1d-98f5-01f9079eff24","resolution":{"observed_at":"2026-08-06T23:55:55.298745Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.03248","last_updated":"2026-05-27T15:50:01Z","snapshot_observed_at":"2026-08-06T07:39:27.435014Z","submitted_at":"2024-11-05T16:46:23Z","title":"Improved Hardness Results for Min-Max Optimization with Coupled Constraints","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.03248","snapshot_observed_at":"2026-08-06T23:55:55.302735Z","title":"On the role of constraints in the complexity of min-max optimization","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.302735Z"},"links":{"cited_paper":"/paper/2411.03248","citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:968b4addb05bb2ffeab51780c730efb3edc44ed1d612983036ae0c552e07c461","observation_id":"11adc3f6-e7e8-43b3-bb49-929d1003c02b","resolution":{"observed_at":"2026-08-06T23:55:55.302735Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1912.06680","last_updated":"2019-12-13T19:56:40Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2019-12-13T19:56:40Z","title":"Dota 2 with Large Scale Deep Reinforcement Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1912.06680","snapshot_observed_at":"2026-08-06T23:55:55.306844Z","title":"Dota 2 with large scale deep reinforcement learning","venue":null,"work_id":null,"year":1912},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.306844Z"},"links":{"cited_paper":"/paper/1912.06680","citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:240bf04cdef65f3a8d453a68ef25b3529257743df3a9125395af208fe610fc21","observation_id":"80763eb1-e3e2-4e8e-92a8-2456f16afa45","resolution":{"observed_at":"2026-08-06T23:55:55.306844Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1809.05289","last_updated":"2018-09-14T07:52:37Z","snapshot_observed_at":"2026-07-06T07:02:12.971488Z","submitted_at":"2018-09-14T07:52:37Z","title":"Lyapunov Theory for Discrete Time Systems","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1809.05289","snapshot_observed_at":"2026-08-06T23:55:55.310765Z","title":"Lyapunov theory for discrete time systems","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.310765Z"},"links":{"cited_paper":"/paper/1809.05289","citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:bd0a58c07715650155624c2c70d13188b121497dbd0cb5753e3dbe22cf70bbfc","observation_id":"0d744f28-c374-40d4-9b26-2e16b8a6b5d7","resolution":{"observed_at":"2026-08-06T23:55:55.310765Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:55:55.314359Z","title":"Characterizations of ojasiewicz inequalities: subgradient flows, talweg, convexity","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.314359Z"},"links":{"citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:16aaa7c57c324cb9e3d9ca79ed826bda65fe7a9e9872b08b938816566a95125d","observation_id":"c5503538-e3c3-42f3-b762-f6834e713268","resolution":{"observed_at":"2026-08-06T23:55:55.314359Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:55:55.318340Z","title":"Collaborative multi-robot exploration","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.318340Z"},"links":{"citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:f10a058e5b632aa658267008862810298730da06eeaf46834d888cd173593136","observation_id":"1382445c-02c4-46f6-bd23-45fd7e4fd374","resolution":{"observed_at":"2026-08-06T23:55:55.318340Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:55:55.321921Z","title":"Uncoupled and convergent learning in two-player zero-sum markov games with bandit feedback","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.321921Z"},"links":{"citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:fdc596070c0a2b66e7374beb7f8bb5ae0133285c5471f043a6d16790e2e964b7","observation_id":"37efe7a1-19e8-43d1-9bf1-5ae898618eb7","resolution":{"observed_at":"2026-08-06T23:55:55.321921Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:55:55.326541Z","title":"Near-optimal policy optimization for correlated equilibrium in general-sum markov games","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.326541Z"},"links":{"citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:81b5a86cdaecb42e415c14b2fc374676fdbb627e7fa8488b7430f4e4f1b48d5c","observation_id":"ad4e14dd-3206-4bf0-b644-ed11214d4992","resolution":{"observed_at":"2026-08-06T23:55:55.326541Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.01050","last_updated":"2022-10-04T01:07:33Z","snapshot_observed_at":"2026-07-06T13:59:07.953920Z","submitted_at":"2022-10-03T16:05:43Z","title":"Faster Last-iterate Convergence of Policy Optimization in Zero-Sum Markov Games","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.01050","snapshot_observed_at":"2026-08-06T23:55:55.330055Z","title":"Faster last-iterate convergence of policy optimization in zero-sum markov games","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.330055Z"},"links":{"cited_paper":"/paper/2210.01050","citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:57b10ba52390cae2f5eb78318f411b539c3732817087f9cd82e32c78e86cd060","observation_id":"8be7fb11-9d23-4093-b274-c061536901a9","resolution":{"observed_at":"2026-08-06T23:55:55.330055Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:55:55.333870Z","title":"Alternation makes the adversary weaker in two-player games","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.333870Z"},"links":{"citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:cb36f000839e02486cb584913e2e842605ffdd34638db21254ad8f7a76256281","observation_id":"0e2fe7c8-cc06-43da-a294-cc8434ef64c7","resolution":{"observed_at":"2026-08-06T23:55:55.333870Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:55:55.337513Z","title":"Chambolle and Thomas Pock","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.337513Z"},"links":{"citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:1a573542f0d0ce28410515438cf9e84a458364161114a7170bbbccd8a054ad56","observation_id":"2143b875-fbc6-4642-b290-33350b624643","resolution":{"observed_at":"2026-08-06T23:55:55.337513Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:55:55.340782Z","title":"On the theory of reinforcement learning with once-per-episode feedback","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.340782Z"},"links":{"citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:554e44333bfa45f02a77ca081a72017a8d687023f7f3b4347cb146ead1efde65","observation_id":"0ea53250-a11f-4fd9-bc93-b0afe62a140d","resolution":{"observed_at":"2026-08-06T23:55:55.340782Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:55:55.344514Z","title":"Reducing noise in gan training with variance reduced extragradient","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.344514Z"},"links":{"citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:ba8926782f179a0738d02d9a86383e6b4b973557199f2b01cf4e5ecaea8ba5f1","observation_id":"f45aa808-8e0d-423d-9605-37482a22276d","resolution":{"observed_at":"2026-08-06T23:55:55.344514Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2006.14567","last_updated":"2021-06-23T17:54:03Z","snapshot_observed_at":"2026-07-06T09:32:48.916535Z","submitted_at":"2020-06-25T17:13:23Z","title":"Taming GANs with Lookahead-Minmax","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.14567","snapshot_observed_at":"2026-08-06T23:55:55.347794Z","title":"Stich, Francois Fleuret, and Martin Jaggi","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.347794Z"},"links":{"cited_paper":"/paper/2006.14567","citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:5f92ee83caa8a02794cb697f35b2c2a548b7e39f916b42771cdb534ff5a9e9bd","observation_id":"037e7605-5069-48e2-ad05-bfe9988ca768","resolution":{"observed_at":"2026-08-06T23:55:55.347794Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:55:55.351985Z","title":"Efficient algorithms for a class of stochastic hidden convex optimization and its applications in network revenue management","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.351985Z"},"links":{"citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:427323e1fd27ff851ca30a2fbdd56a0c766d2f686d380e09a2d820780f95d663","observation_id":"25045e6b-e2b5-4eda-ac38-c948843b7f16","resolution":{"observed_at":"2026-08-06T23:55:55.351985Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1905.06466","last_updated":"2019-05-15T23:09:05Z","snapshot_observed_at":"2026-07-06T07:53:20.629926Z","submitted_at":"2019-05-15T23:09:05Z","title":"Exploration-Exploitation Trade-off in Reinforcement Learning on Online Markov Decision Processes with Global Concave Rewards","version":1},"cited_work":{"arxiv_id":"1905.06466","doi":null,"metadata_source":"pith","pith_arxiv_id":"1905.06466","snapshot_observed_at":"2026-08-06T23:55:57.338134Z","title":"Exploration-Exploitation Trade-off in Reinforcement Learning on Online Markov Decision Processes with Global Concave Rewards","venue":"cs.LG","work_id":"75f4a95a-f2b1-41cd-aaa4-56a460a55617","year":2019},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.355509Z"},"links":{"cited_paper":"/paper/1905.06466","citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:2b873c48f4e01380ee0805bec62cf6f20ee4387af6600a06bae6c22e1290fa43","observation_id":"6370b283-1f85-4b01-8954-4b91d67bd9bc","resolution":{"observed_at":"2026-08-06T23:55:57.398772Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:55:55.359437Z","title":"Regret minimization for reinforcement learning with vectorial feedback and complex objectives","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.359437Z"},"links":{"citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:ff061fb63d5254a0eebb8d8f2fe89a5e0154f7b7d776adb73f60e4c4d0ac7475","observation_id":"089a2018-8031-4cd9-9f11-8e21576b9a90","resolution":{"observed_at":"2026-08-06T23:55:55.359437Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:55:55.362907Z","title":"When are offline two-player zero-sum markov games solvable? Advances in Neural Information Processing Systems, 35: 0 25779--25791, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.362907Z"},"links":{"citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:fd65163470d213414c6241375ee691549af89865a01ca283e5d8353195fb6f18","observation_id":"6005b0c2-0a6f-4dea-b7bc-bd59a82cb040","resolution":{"observed_at":"2026-08-06T23:55:55.362907Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:55:55.366737Z","title":"Breaking the curse of multiagents in a large state space: Rl in markov games with independent linear function approximation","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.366737Z"},"links":{"citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:289fec34e630e385d9a9bb58589203cea9e1fa5a17884285380a74a8e092a665","observation_id":"d677b73d-6c69-4ce1-be55-455fd4d66758","resolution":{"observed_at":"2026-08-06T23:55:55.366737Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:55:55.369922Z","title":"Independent policy gradient methods for competitive reinforcement learning","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.369922Z"},"links":{"citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:825a5edc34b4983792667e331c888494e31fec2f29605b6f8e0b02636dd76655","observation_id":"bf2accfb-5022-440c-b8c7-9360b2ddecdd","resolution":{"observed_at":"2026-08-06T23:55:55.369922Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:55:55.373654Z","title":"The complexity of constrained min-max optimization","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.373654Z"},"links":{"citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:34f66e5d0e1747eeb96d38ec7655652e808b6fa03d3c93c7c3aa773f591f38e2","observation_id":"caf9b43c-40e8-4be2-b791-665defe2b3b3","resolution":{"observed_at":"2026-08-06T23:55:55.373654Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:55:55.377092Z","title":"The complexity of markov equilibrium in stochastic games","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.377092Z"},"links":{"citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:658c4e744422654232e584c3eb7ea5e0bc7f2a4645cce2cb08bd0039350c629d","observation_id":"efc791ea-c1cb-4f91-bc47-dde24509abf0","resolution":{"observed_at":"2026-08-06T23:55:55.377092Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:55:55.380773Z","title":"On the complexity of computing markov perfect equilibrium in general-sum stochastic games","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.380773Z"},"links":{"citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:15af2747c2b4a8240ab4ffded413421f3d132487a44fb28b5794fed03c703a72","observation_id":"6408dd65-2f1e-4a69-8c20-59a59c5b71b5","resolution":{"observed_at":"2026-08-06T23:55:55.380773Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:55:55.385240Z","title":"First-order methods of smooth convex optimization with inexact oracle","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.385240Z"},"links":{"citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:10a78956a2e11705283dc9d7acdece714170648cd8e344efca41719a09c246b2","observation_id":"91e1c30c-cf0d-47df-a451-caca0d671ff8","resolution":{"observed_at":"2026-08-06T23:55:55.385240Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:55:55.388732Z","title":"Efficient methods for structured nonconvex-nonconcave min-max optimization","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.388732Z"},"links":{"citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:461c79d0bf7c9f6ce7fd2e6857ce9372127c76f7ea2b95a1b1ea2419d975270d","observation_id":"0130da41-c8b3-48e4-9f9f-2719d91a9038","resolution":{"observed_at":"2026-08-06T23:55:55.388732Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:55:55.392760Z","title":"Independent policy gradient for large-scale markov potential games: Sharper rates, function approximation, and game-agnostic convergence","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.392760Z"},"links":{"citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:996f09ae3160c8a9304457d00545eff97ef271bc733fae0a85a674bdf78c061c","observation_id":"902b2dea-8592-4a46-aeae-efdc0fcd9f80","resolution":{"observed_at":"2026-08-06T23:55:55.392760Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:55:55.396356Z","title":"Error bounds, quadratic growth, and linear convergence of proximal methods","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.396356Z"},"links":{"citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:8c145df6a6fad705facd7365a17dd1283bbade5eb620fe853bb9ce94adfde6e7","observation_id":"5e1ab08d-b30d-4313-bf51-0d7edce9ebde","resolution":{"observed_at":"2026-08-06T23:55:55.396356Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:55:55.399674Z","title":"Efficiency of minimizing compositions of convex functions and smooth maps","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.399674Z"},"links":{"citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:aba37cd9ff9d2d9c1d9b4e2b53c9c1cdb698b8feb2595446274e2bfcddc226cb","observation_id":"9f410ae8-a9d8-4afc-89ae-e06e372bb6e1","resolution":{"observed_at":"2026-08-06T23:55:55.399674Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:55:55.403042Z","title":"Reinforcement learning with trajectory feedback","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.403042Z"},"links":{"citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:5ca4972bf717f300cbc1936ae70eeed792a66a1284fd9fbb7df292e464aa4a1d","observation_id":"c8d1c455-23eb-46f4-950e-10fc53227b0c","resolution":{"observed_at":"2026-08-06T23:55:55.403042Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:55:55.407606Z","title":"Regret minimization and convergence to equilibria in general-sum markov games","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.407606Z"},"links":{"citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:eebda8cc2f041ef40b25f89f5bad4519c21745fbe9eefc2694a5655a53d01504","observation_id":"fc4beae2-43d6-4816-b0cc-6c0345d62e28","resolution":{"observed_at":"2026-08-06T23:55:55.407606Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:55:55.412278Z","title":"Finite-dimensional variational inequalities and complementarity problems","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.412278Z"},"links":{"citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:78f66e53ddf5ab4bb3c757b02fbf590d8857c316c0e8d5dca0070a8b9864f2ad","observation_id":"28968245-6b81-4348-a0ed-c20032df8f19","resolution":{"observed_at":"2026-08-06T23:55:55.412278Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:55:55.416300Z","title":"Finite-dimensional variational inequalities and complementarity problems","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.416300Z"},"links":{"citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:5f054d9fd853cb12dc40c8833a75bf58993336e419d1b8061896068e3bf57b6e","observation_id":"c9b7d9c5-89a8-4f99-82dd-681f1242f679","resolution":{"observed_at":"2026-08-06T23:55:55.416300Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.00108","last_updated":"2024-11-09T12:16:12Z","snapshot_observed_at":"2026-07-06T17:10:04.065416Z","submitted_at":"2023-12-30T01:09:29Z","title":"Stochastic Optimization under Hidden Convexity","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.00108","snapshot_observed_at":"2026-08-06T23:55:55.419582Z","title":"Stochastic optimization under hidden convexity","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.419582Z"},"links":{"cited_paper":"/paper/2401.00108","citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:9c5d254a2c7a482c6b0e3266204b428c373dba2708bdaed92f9f088d30cf0548","observation_id":"d77fb016-3c45-475e-9f73-f3a48b49d4db","resolution":{"observed_at":"2026-08-06T23:55:55.419582Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:55:55.423161Z","title":"Supply and demand functions in inventory models","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.423161Z"},"links":{"citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:5618b705f32ee9a70dcf903288a525d5fb3ee4656f8386b7c6ea06667a9a3525","observation_id":"2dc0fe3a-6b5f-421d-9e94-bc23b3b19d7e","resolution":{"observed_at":"2026-08-06T23:55:55.423161Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:55:55.426682Z","title":"Equilibrium in a stochastic n -person game","venue":null,"work_id":null,"year":1964},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.426682Z"},"links":{"citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:74d61b664066a516c0fde4d02fb619002724f448cce8a5f815cd31e896c2ca2f","observation_id":"881d32f4-a490-4495-87c3-119e8fdccfaf","resolution":{"observed_at":"2026-08-06T23:55:55.426682Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:55:55.430009Z","title":"Concave utility reinforcement learning: The mean-field game viewpoint","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.430009Z"},"links":{"citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:2a52d430dd2ff5ccf064acab8fd0d5c63206c96aba4f625560e74ae01598bad4","observation_id":"79363ec6-3f92-4cc5-b728-bd94be71c9e9","resolution":{"observed_at":"2026-08-06T23:55:55.430009Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.16600","last_updated":"2025-06-16T09:03:24Z","snapshot_observed_at":"2026-07-06T19:37:33.729773Z","submitted_at":"2024-10-22T00:55:04Z","title":"Convex Markov Games: A New Frontier for Multi-Agent Reinforcement Learning","version":3},"cited_work":{"arxiv_id":"2410.16600","doi":null,"metadata_source":"pith","pith_arxiv_id":"2410.16600","snapshot_observed_at":"2026-08-06T23:55:57.170347Z","title":"Convex Markov Games: A New Frontier for Multi-Agent Reinforcement Learning","venue":"cs.GT","work_id":"f4df64ab-6963-4ccd-a907-9817996a6d3b","year":2024},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.434124Z"},"links":{"cited_paper":"/paper/2410.16600","citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:8fd0c8c6608d74d98b28a5fe2447637b264574864a425386e04feb8c0d7d0b08","observation_id":"3b79ff51-2e1a-480e-81d8-292e59924d3d","resolution":{"observed_at":"2026-08-06T23:55:57.251427Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:55:55.437916Z","title":"Mini-batch stochastic approximation methods for nonconvex stochastic composite optimization","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.437916Z"},"links":{"citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:dc1ade3d62245c5b30f7b7e36aed8bd9ad1ce27c7f083e29121dc79b1d8a7c34","observation_id":"a3cd0dde-1974-4d86-8d6d-71277861e5db","resolution":{"observed_at":"2026-08-06T23:55:55.437916Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:55:55.441762Z","title":"Negative momentum for improved game dynamics","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.441762Z"},"links":{"citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:33f0275a64740aeaa7500e73a008ae6fe47c45679a708663ef57e1410cbedb49","observation_id":"04faf5f4-89b0-4c1a-9722-36bfe2a0126b","resolution":{"observed_at":"2026-08-06T23:55:55.441762Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:55:55.446088Z","title":"Generative adversarial nets","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.446088Z"},"links":{"citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:53b4cfed8d78a0f7d4a64aa6fd1cbfdab923b43ce1c0cea03b52f7b55240e1c8","observation_id":"e4863b49-091a-47e6-957a-551fcca7115e","resolution":{"observed_at":"2026-08-06T23:55:55.446088Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:55:55.449678Z","title":"Multi-agent deep reinforcement learning: a survey","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.449678Z"},"links":{"citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:e62d5f7757192a9382d84af5c42ddd54ed8b35923559648997fa2cba8075d775","observation_id":"904e9c40-b40b-4504-ad0b-c86eac72a56c","resolution":{"observed_at":"2026-08-06T23:55:55.449678Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:55:55.453260Z","title":"Provably efficient maximum entropy exploration","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.453260Z"},"links":{"citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:5d55c4c06aac8d6a68ba187cd9efda3027a20a39651a9ce0b231b8eefc4f87e9","observation_id":"2b964323-e6ec-438f-bfde-20ef021dad00","resolution":{"observed_at":"2026-08-06T23:55:55.453260Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:55:55.457031Z","title":"Inequity aversion improves cooperation in intertemporal social dilemmas","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.457031Z"},"links":{"citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:c64c7412307bf38625f1c3bda7849307b752d86cefdc9ce60900d13d11174068","observation_id":"e100ec1e-ba70-4fff-b16f-1b5d2e2dccd1","resolution":{"observed_at":"2026-08-06T23:55:55.457031Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:55:55.460420Z","title":"Proximal stochastic methods for nonsmooth nonconvex finite-sum optimization","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.460420Z"},"links":{"citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:91e3f79cddb0d1d32ba854a6183bc8fbca2257ea616ecab15f1cf79590e06268","observation_id":"bc0158cf-3812-4c9d-8eca-6a92a9ed493f","resolution":{"observed_at":"2026-08-06T23:55:55.460420Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:55:55.463788Z","title":"What is local optimality in nonconvex-nonconcave minimax optimization? In International conference on machine learning, pages 4880--4889","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.463788Z"},"links":{"citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:eddbd55e236d07d4846355b85077e1874b000df3c9da134dd321afa177de8fee","observation_id":"da9ddc6c-18f8-47f6-a6d7-9787f1c7bb39","resolution":{"observed_at":"2026-08-06T23:55:55.463788Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2110.14555","last_updated":"2021-10-27T16:25:55Z","snapshot_observed_at":"2026-07-06T12:02:42.908923Z","submitted_at":"2021-10-27T16:25:55Z","title":"V-Learning -- A Simple, Efficient, Decentralized Algorithm for Multiagent RL","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.14555","snapshot_observed_at":"2026-08-06T23:55:55.468336Z","title":"V-learning--a simple, efficient, decentralized algorithm for multiagent rl","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.468336Z"},"links":{"cited_paper":"/paper/2110.14555","citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:6f0e4c2a5227e5379e6de861e195fbd5e4ca7ed044bf6242c2000e688e824695","observation_id":"3a825803-a28a-442c-b7d2-831213d857ff","resolution":{"observed_at":"2026-08-06T23:55:55.468336Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2204.04186","last_updated":"2022-11-29T17:32:14Z","snapshot_observed_at":"2026-07-06T12:58:20.391081Z","submitted_at":"2022-04-08T17:24:16Z","title":"The Complexity of Infinite-Horizon General-Sum Stochastic Games","version":2},"cited_work":{"arxiv_id":"2204.04186","doi":null,"metadata_source":"pith","pith_arxiv_id":"2204.04186","snapshot_observed_at":"2026-08-06T23:55:56.984162Z","title":"The Complexity of Infinite-Horizon General-Sum Stochastic Games","venue":"cs.GT","work_id":"12ec3d93-8520-4eb1-9e2b-b727d50ae82b","year":2022},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.472367Z"},"links":{"cited_paper":"/paper/2204.04186","citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:ee3df7918b06c9b514685e168bbfb6cfd80d851b559071c3719f82206e79ed88","observation_id":"31dc38b4-9fa4-476f-861c-20728d3bd435","resolution":{"observed_at":"2026-08-06T23:55:57.061811Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:55:55.477566Z","title":"Zero-sum polymatrix markov games: Equilibrium collapse and efficient computation of nash equilibria","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.477566Z"},"links":{"citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:e9d79117354acd61c292035b6753678f6b38fea1ed9bcf99af9edd554590f37c","observation_id":"d3456a67-2319-426a-8604-dfbc5b15d557","resolution":{"observed_at":"2026-08-06T23:55:55.477566Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2208.02204","last_updated":"2022-08-03T16:41:01Z","snapshot_observed_at":"2026-07-06T13:38:28.783991Z","submitted_at":"2022-08-03T16:41:01Z","title":"Efficiently Computing Nash Equilibria in Adversarial Team Markov Games","version":1},"cited_work":{"arxiv_id":"2208.02204","doi":null,"metadata_source":"pith","pith_arxiv_id":"2208.02204","snapshot_observed_at":"2026-08-06T23:55:56.766571Z","title":"Efficiently Computing Nash Equilibria in Adversarial Team Markov Games","venue":"cs.GT","work_id":"81d0f739-a9ff-48dd-808e-b799991ea364","year":2022},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.481890Z"},"links":{"cited_paper":"/paper/2208.02204","citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:dfe59d2dc2c74435b7e96e4c629c53f2a0288d42433c98ddfa18cced41f21a42","observation_id":"4e6266c0-27de-430f-86fd-cee783456366","resolution":{"observed_at":"2026-08-06T23:55:56.870375Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.05673","last_updated":"2024-10-08T04:07:26Z","snapshot_observed_at":"2026-08-03T22:08:26.933354Z","submitted_at":"2024-10-08T04:07:26Z","title":"Learning Equilibria in Adversarial Team Markov Games: A Nonconvex-Hidden-Concave Min-Max Optimization Problem","version":1},"cited_work":{"arxiv_id":"2410.05673","doi":null,"metadata_source":"pith","pith_arxiv_id":"2410.05673","snapshot_observed_at":"2026-08-06T23:55:56.580147Z","title":"Learning Equilibria in Adversarial Team Markov Games: A Nonconvex-Hidden-Concave Min-Max Optimization Problem","venue":"cs.GT","work_id":"5c1d8e23-4c83-4b62-9e6e-103746a29074","year":2024},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.486004Z"},"links":{"cited_paper":"/paper/2410.05673","citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:f546e071444d7d2c722fc9d441b92aa4f8cdb68d8d01273d7d78408c272fe77d","observation_id":"8be8e110-e170-4af9-a33d-662ad4a101ac","resolution":{"observed_at":"2026-08-06T23:55:56.652128Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:55:55.489824Z","title":"Linear convergence of gradient and proximal-gradient methods under the polyak- ojasiewicz condition","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.489824Z"},"links":{"citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:dc2e64e4c1e8157508afc2411a5bc1358418bb74446a235b3a907df305116de4","observation_id":"c5fed828-b90c-43c3-bd5d-9794a7504799","resolution":{"observed_at":"2026-08-06T23:55:55.489824Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:55:55.493299Z","title":"An introduction to variational inequalities and their applications","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.493299Z"},"links":{"citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:02b9f2f76fac3c8c1a5cb58fa905aa34582fce4050d5ba110d4f3da0446bdf54","observation_id":"0b734b91-736f-4f9d-a3c0-af8dfe1191b3","resolution":{"observed_at":"2026-08-06T23:55:55.493299Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:55:55.497455Z","title":"Normalizing flows: An introduction and review of current methods","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.497455Z"},"links":{"citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:a6849774e25f4f3206be3f472fe9218dd1eca904837c0306c0234bb09e860afa","observation_id":"5a121532-dfd4-45da-9428-688652693de9","resolution":{"observed_at":"2026-08-06T23:55:55.497455Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:55:55.501829Z","title":null,"venue":null,"work_id":null,"year":1976},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.501829Z"},"links":{"citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:88754fe2dcad7cfcda5d81ca1b5456b96217f1ddbcad87624af8c4cb8ff9272d","observation_id":"ecca372f-6af9-49b1-a1dc-164dc5b2dba5","resolution":{"observed_at":"2026-08-06T23:55:55.501829Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1908.09453","last_updated":"2020-09-26T11:49:05Z","snapshot_observed_at":"2026-08-04T22:42:57.075441Z","submitted_at":"2019-08-26T03:31:35Z","title":"OpenSpiel: A Framework for Reinforcement Learning in Games","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1908.09453","snapshot_observed_at":"2026-08-06T23:55:55.505791Z","title":"Openspiel: A framework for reinforcement learning in games","venue":null,"work_id":null,"year":1908},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":66,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.505791Z"},"links":{"cited_paper":"/paper/1908.09453","citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:5528d790797d2dc0f82c174b04671dc3ebd80e4d0ac554e6348b5e314f61984e","observation_id":"ae2fe723-e3d1-492c-9e3b-a91ef44c178d","resolution":{"observed_at":"2026-08-06T23:55:55.505791Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.10475","last_updated":"2024-07-15T08:21:28Z","snapshot_observed_at":"2026-08-03T06:43:18.385453Z","submitted_at":"2024-02-16T06:41:35Z","title":"Fundamental Benefit of Alternating Updates in Minimax Optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.10475","snapshot_observed_at":"2026-08-06T23:55:55.510172Z","title":"Fundamental benefit of alternating updates in minimax optimization","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.510172Z"},"links":{"cited_paper":"/paper/2402.10475","citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:dfd32bb0abd05848c3543155026e2d5bc7cd9c761fcdd1319a06e3258ceaca3e","observation_id":"0c3ffaec-b996-492e-ac4e-12e963c63ef0","resolution":{"observed_at":"2026-08-06T23:55:55.510172Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:55:55.514045Z","title":"Global convergence of multi-agent policy gradient in markov potential games","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":68,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.514045Z"},"links":{"citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:6e98b284964e2521e89b943c1debdf78ff554d226ef80e4920ff6f51a73b0074","observation_id":"4fec25e7-cfd9-404e-83e5-15f3336ff9a2","resolution":{"observed_at":"2026-08-06T23:55:55.514045Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:55:55.517762Z","title":"Hidden convex minimization","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":69,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.517762Z"},"links":{"citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:ce6fc7fbe49a6c795f3a2f273f73c0435c1bb675b84c0177a534793e4e2a140f","observation_id":"c99db640-4ead-42d0-9253-3a8ccb41642a","resolution":{"observed_at":"2026-08-06T23:55:55.517762Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:55:55.521215Z","title":"Calculus of the exponent of kurdyka-- ojasiewicz inequality and its applications to linear convergence of first-order methods","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":70,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.521215Z"},"links":{"citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:0d45dde9a9908775dc7a7f235bd28cc05c80d620d873ae55d047ff79a9ce8722","observation_id":"a7a2ed27-c835-49d6-90ba-e76f356e9213","resolution":{"observed_at":"2026-08-06T23:55:55.521215Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:55:55.524936Z","title":"H \\\"o lder continuity of perturbed solution set for convex optimization problems","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":71,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.524936Z"},"links":{"citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:33e5fd34477ca7587c52c7bac17b1860dd999c0873b256f12e3ae81366f045c0","observation_id":"20217421-155b-4915-b349-a94706be1472","resolution":{"observed_at":"2026-08-06T23:55:55.524936Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:55:55.528543Z","title":"Error bounds, pl condition, and quadratic growth for weakly convex functions, and linear convergences of proximal point methods","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":72,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.528543Z"},"links":{"citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:8079191b267dbc9193fa167c2353c00d889b007f1734e7ba2554b829a5285851","observation_id":"d051a1f6-731b-4c00-955a-963c089d0c3b","resolution":{"observed_at":"2026-08-06T23:55:55.528543Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:55:55.532378Z","title":"On gradient descent ascent for nonconvex-concave minimax problems","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":73,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.532378Z"},"links":{"citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:23d46cf4d9b90325a1af6a5dfe63dbc4ee1b1c8270eead45228df74131de8424","observation_id":"41f71a99-a8bc-4d11-b237-b05cce08ba34","resolution":{"observed_at":"2026-08-06T23:55:55.532378Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:55:55.536070Z","title":"Markov games as a framework for multi-agent reinforcement learning","venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":74,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.536070Z"},"links":{"citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:3860c1fe0a5c86660a483ffefae7d33a39f8d5a3e3820c0cca694155d4fd9588","observation_id":"edc303b0-7176-4aa2-bd96-0bafc9c0af2d","resolution":{"observed_at":"2026-08-06T23:55:55.536070Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:55:55.539609Z","title":"First-order convergence theory for weakly-convex-weakly-concave min-max problems","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":75,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.539609Z"},"links":{"citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:2f9188c18a3a31a89baf19c5075d7b15f3420e0ae8df182660f1c2027d0c8c6e","observation_id":"ea26e537-2143-481a-88d8-a8a9223bf220","resolution":{"observed_at":"2026-08-06T23:55:55.539609Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:55:55.543156Z","title":"Alternating gradient descent ascent for nonconvex min-max problems in robust learning and gans","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":76,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.543156Z"},"links":{"citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:052cb2d7f3adfa7b421d4f230d1b457cf8cb3023188cd27325244681f0ba57e1","observation_id":"a8e9cdaa-abce-439b-8e8f-fabeb11f2fed","resolution":{"observed_at":"2026-08-06T23:55:55.543156Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:55:55.546807Z","title":"Error bounds and convergence analysis of feasible descent methods: a general approach","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":77,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.546807Z"},"links":{"citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:48d1713d6ae6a9112538b34aafb090cdf2f9801eb85a5d938a028e9e18d87b08","observation_id":"ccb17405-cff9-4211-a167-77e336a20309","resolution":{"observed_at":"2026-08-06T23:55:55.546807Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1706.06083","last_updated":"2019-09-04T18:53:10Z","snapshot_observed_at":"2026-08-07T14:27:46.872660Z","submitted_at":"2017-06-19T17:53:11Z","title":"Towards Deep Learning Models Resistant to Adversarial Attacks","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1706.06083","snapshot_observed_at":"2026-08-06T23:55:55.550894Z","title":"Towards deep learning models resistant to adversarial attacks","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":78,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.550894Z"},"links":{"cited_paper":"/paper/1706.06083","citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:16c06b638de8c13d044dd8b8af05e2a65668d11ff56fc8b83fe0db67b5124b7a","observation_id":"ed43505f-d455-465c-be9e-6c04a755c255","resolution":{"observed_at":"2026-08-06T23:55:55.550894Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:55:55.555566Z","title":"Martinet","venue":null,"work_id":null,"year":1970},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":79,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.555566Z"},"links":{"citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:7ec9532706ece3d8e977b9786a2b91d79e6b2fcf1573e3de73830eff9c85177c","observation_id":"57b0db3c-f826-45c0-98c4-cb8d040d06a7","resolution":{"observed_at":"2026-08-06T23:55:55.555566Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1807.02629","last_updated":"2018-10-01T23:11:31Z","snapshot_observed_at":"2026-07-06T06:48:52.967374Z","submitted_at":"2018-07-07T08:08:33Z","title":"Optimistic mirror descent in saddle-point problems: Going the extra (gradient) mile","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1807.02629","snapshot_observed_at":"2026-08-06T23:55:55.559256Z","title":"Optimistic mirror descent in saddle-point problems: Going the extra (gradient) mile","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":80,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.559256Z"},"links":{"cited_paper":"/paper/1807.02629","citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:1f96b1afa187245f892eda5b800194ab8a539616eadef784e732c17799353885","observation_id":"2b1ea698-2523-41a9-90bd-9df850acdd3d","resolution":{"observed_at":"2026-08-06T23:55:55.559256Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:56:03.096177Z","title":"Generalized natural gradient flows in hidden convex-concave games and gans","venue":null,"work_id":"4c9605f5-111b-4c0d-948d-edd86890bb38","year":2021},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":81,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.563014Z"},"links":{"citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:ba47cec908678371f313a76124971c4fb848b4cb14940826b7030ce79f23a4dd","observation_id":"ad8f8ce3-a832-4676-a387-7c34ba17f224","resolution":{"observed_at":"2026-08-06T23:56:03.151747Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1312.5602","last_updated":"2013-12-19T16:00:08Z","snapshot_observed_at":"2026-07-06T03:31:23.521122Z","submitted_at":"2013-12-19T16:00:08Z","title":"Playing Atari with Deep Reinforcement Learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1312.5602","snapshot_observed_at":"2026-08-06T23:55:55.566892Z","title":"Playing atari with deep reinforcement learning","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":82,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.566892Z"},"links":{"cited_paper":"/paper/1312.5602","citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:c58ce92aaf21709eeb0e9ca4d2072492a88622e2225ad3e65036b333dc1b5f27","observation_id":"458baae4-f26b-4229-8801-901fe090ff0e","resolution":{"observed_at":"2026-08-06T23:55:55.566892Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:56:03.033377Z","title":"Dynamic regret bounds for constrained online nonconvex optimization based on polyak--lojasiewicz regions","venue":null,"work_id":"1821a13b-4b67-427c-af4a-1311a41cf9cc","year":2022},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":83,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.570955Z"},"links":{"citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:e606dc2d5584b88523513c466ca069da862edd232a4f9b8b4c1415d03a655094","observation_id":"597fa690-27c2-4158-a1bf-a2268dba47af","resolution":{"observed_at":"2026-08-06T23:56:03.059519Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1912.02074","last_updated":"2019-12-04T16:06:10Z","snapshot_observed_at":"2026-08-05T10:28:32.357062Z","submitted_at":"2019-12-04T16:06:10Z","title":"AlgaeDICE: Policy Gradient from Arbitrary Experience","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1912.02074","snapshot_observed_at":"2026-08-06T23:55:55.574509Z","title":"Algaedice: Policy gradient from arbitrary experience","venue":null,"work_id":null,"year":1912},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":84,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.574509Z"},"links":{"cited_paper":"/paper/1912.02074","citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:c00d4b4499f0a3b8601331d1ff6f87b7df6ea55de93372863e30b5a3239c6f4b","observation_id":"d3d6c894-c0a1-4832-876c-7d0d4c225446","resolution":{"observed_at":"2026-08-06T23:55:55.574509Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:56:02.945186Z","title":"Prox-method with rate of convergence o(1/t) for variational inequalities with lipschitz continuous monotone operators","venue":null,"work_id":"4f954a48-716c-43d2-aba3-689c0f51aeab","year":2004},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":85,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.578461Z"},"links":{"citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:9561ef8936f87ba07741f695437cd966f881fa7466e2b6c8aa63b95ac214adcb","observation_id":"3cfe18a4-af86-4d37-b9cb-bac03ebae468","resolution":{"observed_at":"2026-08-06T23:56:02.994517Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:55:55.582013Z","title":"Robust stochastic approximation approach to stochastic programming","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":86,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.582013Z"},"links":{"citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:53de6c4766833524f3d36a6c7c673596dc99ba36e676bcea288c00107c6f0a7f","observation_id":"092f8ab9-90d2-49d7-bdbf-4d8b35c49dfc","resolution":{"observed_at":"2026-08-06T23:55:55.582013Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:56:02.844478Z","title":"Smooth minimization of non-smooth functions","venue":null,"work_id":"fb081da3-6d69-4ef5-a18e-4ddf5e98ca02","year":2005},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":87,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.585429Z"},"links":{"citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:e3297e1472ed656ad52ca47c6aa6e789a67dd0430da7719e2b0115505c2ecf58","observation_id":"2e225fc9-6e53-4364-9565-910affef6951","resolution":{"observed_at":"2026-08-06T23:56:02.885046Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1705.07798","last_updated":"2017-05-22T15:06:25Z","snapshot_observed_at":"2026-07-06T05:43:40.624942Z","submitted_at":"2017-05-22T15:06:25Z","title":"A unified view of entropy-regularized Markov decision processes","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1705.07798","snapshot_observed_at":"2026-08-06T23:55:55.589413Z","title":"A unified view of entropy-regularized markov decision processes","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":88,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.589413Z"},"links":{"cited_paper":"/paper/1705.07798","citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:fb2676c30d67c82327028614ffc1eb02c65bd1e6496347aedebc95a07d3bdc4a","observation_id":"4fd9749c-4b2e-4f4e-86e4-6a7e3959e85a","resolution":{"observed_at":"2026-08-06T23:55:55.589413Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:55:55.593142Z","title":"Solving a class of non-convex min-max games using iterative first order methods","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":89,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.593142Z"},"links":{"citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:58be16e7481d1a3b6910ee1744bb3017e81292b391b2d2655a9f53a9888f3a8a","observation_id":"f0ffeaf7-3153-4eee-a8bf-cd98ba662282","resolution":{"observed_at":"2026-08-06T23:55:55.593142Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.18098","last_updated":"2025-03-23T15:05:39Z","snapshot_observed_at":"2026-08-07T16:43:10.080950Z","submitted_at":"2025-03-23T15:05:39Z","title":"Forward-backward splitting under the light of generalized convexity","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.18098","snapshot_observed_at":"2026-08-06T23:55:55.596958Z","title":"Forward-backward splitting under the light of generalized convexity","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":90,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.596958Z"},"links":{"cited_paper":"/paper/2503.18098","citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:7bf6c695e89a72b4adb5107950ae3b76729059fc20bc86abea2a551ff91de0a2","observation_id":"4ae7b0f6-df09-4a97-a986-6ba013e6f169","resolution":{"observed_at":"2026-08-06T23:55:55.596958Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:56:02.728433Z","title":"The computational complexity of multi-player concave games and kakutani fixed points","venue":null,"work_id":"ecd55bb4-39f2-4bf5-8f6f-70bc03bb151c","year":2023},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":91,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.600745Z"},"links":{"citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:c0c1741f28b18304057841d0c47a358936d5c43d36e15af41e84557d9cb4ecd7","observation_id":"9af6e866-ead8-4d0b-94ec-43ac37be3eae","resolution":{"observed_at":"2026-08-06T23:56:02.771405Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:56:02.576154Z","title":"Multi-player zero-sum markov games with networked separable interactions","venue":null,"work_id":"0ccda884-fb58-4c01-817b-6091d704dcf0","year":2023},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":92,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.604198Z"},"links":{"citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:8637470dca9d7ec5c45f5b9d05cdf39ece5499ef78dbee3dd1df07cd526d7e19","observation_id":"5e62715b-0cde-4175-8a7b-4c91e6a4b484","resolution":{"observed_at":"2026-08-06T23:56:02.641126Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:56:02.438329Z","title":"Relative entropy policy search","venue":null,"work_id":"5847230f-25fb-4d98-8acf-827c9e28c5fd","year":2010},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":93,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.607494Z"},"links":{"citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:b0244bf9dab274fd17adb85819e3eb2582e21f5b7939b976a049af989f147e04","observation_id":"83bc66d6-59e1-4e85-b7a0-a2fd71eb3796","resolution":{"observed_at":"2026-08-06T23:56:02.503445Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:55:55.611053Z","title":"Polyak and Anatoli B","venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":94,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.611053Z"},"links":{"citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:b214d8415146da0106dc1f813d0dadad7f0427cc88d5a6beb8f17a63d2256705","observation_id":"bc74aa08-a51a-4653-a620-a9fad665ea73","resolution":{"observed_at":"2026-08-06T23:55:55.611053Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:55:55.614653Z","title":"Markov decision processes: discrete stochastic dynamic programming","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":95,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.614653Z"},"links":{"citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:14e513b8c7be34dae7bdd55ddfcc900f6f0b8f2a8be3cbaefd455ec0fc1bfaaa","observation_id":"942c81b4-a85d-465b-82eb-be0e604aadee","resolution":{"observed_at":"2026-08-06T23:55:55.614653Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:56:02.293624Z","title":"Maximum margin planning","venue":null,"work_id":"99e64f86-2c81-4033-bec6-9c2167a4a518","year":2006},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":96,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.618242Z"},"links":{"citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:08c06aff0f5ca6a089ce691adaf3a83cc74c74e82e5960ede5aaf6299ad84e59","observation_id":"ecc91d70-e5e8-4374-b8ba-81c45da5c883","resolution":{"observed_at":"2026-08-06T23:56:02.354884Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:56:02.131898Z","title":"Fast convergence to non-isolated minima: four equivalent conditions for c 2 functions","venue":null,"work_id":"38bace91-fb4f-42e6-925f-33cbcee081a3","year":2024},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":97,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.621317Z"},"links":{"citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:2a35b4a61d503ca8afdf52275f0a218fd148250940fcbab341ad90938e5876b8","observation_id":"596ff501-0fba-4f4c-9a5f-c794e61f80a0","resolution":{"observed_at":"2026-08-06T23:56:02.213221Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:56:01.995499Z","title":"Tyrrell Rockafellar","venue":null,"work_id":"72ac82b6-4e73-4b02-a4c7-cad897897d0e","year":1976},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":98,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.625466Z"},"links":{"citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:2833abf5ff0b13c4b164170f2def50ce02cd2017219595c1eea7c3ea7a3e3468","observation_id":"34ca91fd-74a3-4219-8ee2-ecf88f1afcf6","resolution":{"observed_at":"2026-08-06T23:56:02.063894Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:55:55.628964Z","title":"Variational analysis, volume 317","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":99,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.628964Z"},"links":{"citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:431b5a9ac6ecbc9cc403ebec58b2e3cd5f87ae194c56455dd91572f50f52d79c","observation_id":"a4480692-a95f-4174-85ee-a65c16452fb1","resolution":{"observed_at":"2026-08-06T23:55:55.628964Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T23:56:01.817136Z","title":"Coordination strategies for multi-robot exploration and mapping","venue":null,"work_id":"84985b5e-d6ad-41df-968e-926b9cf90ecb","year":2013},"citing_paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games","version":1},"reference_index":100,"source":"arxiv_source","source_observed_at":"2026-08-06T23:55:55.632354Z"},"links":{"citing_paper":"/paper/2506.16120"},"observation_digest":"sha256:4ab359f1584f732b92c22e559167702466927f11e4e62d9a203ec90f7abdeab5","observation_id":"9a99b49c-926b-4973-a93f-d9212f0644ed","resolution":{"observed_at":"2026-08-06T23:56:01.904314Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2506.16120","last_updated":"2025-06-19T08:12:02Z","latest_version":1,"primary_category":"cs.GT","snapshot_observed_at":"2026-08-06T23:41:57.206076Z","submitted_at":"2025-06-19T08:12:02Z","title":"Solving Zero-Sum Convex Markov Games"},"reference_resolution":{"displayed":100,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":83,"verified_exact":6,"verified_fuzzy":11},"total_outbound_references":140},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 100 of 140 outbound references and 0 inbound Pith citation observations for arXiv:2506.16120."}