Paper Citation Record · LEDGER

The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback

As of 5 August 2026, this Paper Citation Record lists 45 of 45 outbound references and 0 inbound Pith citation observations for arXiv:2604.16087.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2604.16087 v1

Coverage vector

measured 45 of 45 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-05-10T08:10:10.969901Z

measured 45 of 45 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-05T06:32:48.257954+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

45 of 45 outbound references displayed

verified exact16
verified fuzzy21
unresolved4
parse uncertain0
malformed identifier0
metadata mismatch4

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 1273f655-5d7f-4487-8cd5-b412ac33443c · outbound

This paper cites Last-iterate convergence with full and noisy feedback in two-player zero-sum games.

The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback Last-iterate convergence with full and noisy feedback in two-player zero-sum games

Reference 1

Resolution: verified fuzzy; raw_fallback, observed 2026-05-21T11:24:09.252990Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 0610bd2e-16b2-4797-aa88-b749b1fad065 · outbound

This paper cites Com- put.32, 1 (2002), 48–77.

The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback Com- put.32, 1 (2002), 48–77

Reference 2

Resolution: verified exact; doi, observed 2026-05-10T08:12:25.685559Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 58762aa9-f9f8-471a-a62b-be9e410ead5c · outbound

This paper cites The last-iterate convergence rate of optimistic mirror descent in stochastic variational inequalities.

The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback The last-iterate convergence rate of optimistic mirror descent in stochastic variational inequalities

Reference 3

Resolution: verified fuzzy; raw_fallback, observed 2026-05-21T11:24:09.255152Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation c2708eac-7697-4116-82cd-a528e36f5d6a · outbound

This paper cites Doubly Optimal No - Regret Online Learning in Strongly Monotone Games with Bandit Feedback.

The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback Doubly Optimal No - Regret Online Learning in Strongly Monotone Games with Bandit Feedback

Reference 4

Resolution: verified exact; arxiv_id, observed 2026-05-10T08:12:25.680955Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 52d514ac-b8ce-4726-b4b5-99a02ea3a010 · outbound

This paper cites Théorie des opérations linéaires.

The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback Théorie des opérations linéaires

Reference 5

Resolution: verified fuzzy; raw_fallback, observed 2026-05-21T11:24:09.261409Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation acf1cedb-0a0d-4628-a481-5d35765fceea · outbound

This paper cites Bandit Learning in Concave N - Person Games.

The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback Bandit Learning in Concave N - Person Games

Reference 6

Resolution: verified fuzzy; raw_fallback, observed 2026-05-21T11:24:09.244594Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 354cff71-d792-4735-b103-d0eb81fe3443 · outbound

This paper cites Uncoupled and convergent learning in two-player zero-sum markov games with bandit feedback.

The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback Uncoupled and convergent learning in two-player zero-sum markov games with bandit feedback

Reference 7

Resolution: verified fuzzy; raw_fallback, observed 2026-05-21T11:24:09.246643Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation a8e93687-5021-44b3-a264-2b0dd5f90bc5 · outbound

This paper cites Fast Last - Iterate Convergence of Learning in Games Requires Forgetful Algorithms.

The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback Fast Last - Iterate Convergence of Learning in Games Requires Forgetful Algorithms

Reference 8

Resolution: verified fuzzy; raw_fallback, observed 2026-05-21T11:24:09.248582Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation ace67573-d648-44bb-82c7-8d1b46f44e67 · outbound

This paper cites Prediction, Learning, and Games.

The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback Prediction, Learning, and Games

Reference 9

Resolution: verified exact; doi, observed 2026-05-10T08:12:25.690929Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation faf85bfa-3c2d-4965-bc50-1c0e8a646e88 · outbound

This paper cites Online Optimization with Gradual Variations.

The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback Online Optimization with Gradual Variations

Reference 10

Resolution: verified fuzzy; raw_fallback, observed 2026-05-21T11:24:09.250574Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 2a3c9acb-4210-4ba3-bb4b-092a1487d63e · outbound

This paper cites Uncoupled and Convergent Learning in Monotone Games under Bandit Feedback.

The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback Uncoupled and Convergent Learning in Monotone Games under Bandit Feedback

Reference 11

Resolution: metadata mismatch; arxiv_id, observed 2026-05-10T08:12:26.636704Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 4c9e3bf4-6b3c-4919-8eab-f5247e87616b · outbound

This paper cites In: 2022 IEEE 61st Conference on Decision and Control (CDC).

The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback In: 2022 IEEE 61st Conference on Decision and Control (CDC)

Reference 12

Resolution: metadata mismatch; arxiv_id, observed 2026-05-10T08:12:25.688575Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 8ad890a6-105c-4ad3-a70a-a29b0f538d98 · outbound

This paper cites and Pang, J.-S.

The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback and Pang, J.-S

Reference 13

Resolution: verified exact; doi, observed 2026-05-10T08:12:25.693019Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 68c49bed-f726-487a-8678-1520d3c6e15d · outbound

This paper cites Fictitious self-play in extensive-form games.

The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback Fictitious self-play in extensive-form games

Reference 14

Resolution: verified fuzzy; raw_fallback, observed 2026-05-21T11:24:09.238375Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation b49d0381-f75e-4383-bade-b80f8ee7f677 · outbound

This paper cites and Lemaréchal, C.

The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback and Lemaréchal, C

Reference 15

Resolution: verified exact; doi, observed 2026-05-10T08:12:25.682948Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 195a72b8-774d-4574-81ca-80040dd693cd · outbound

This paper cites On the Convergence of Single - Call Stochastic Extra - Gradient Methods.

The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback On the Convergence of Single - Call Stochastic Extra - Gradient Methods

Reference 16

Resolution: verified fuzzy; raw_fallback, observed 2026-05-21T11:24:09.240436Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation e61e41c4-5812-4375-8dae-2456db13fa3c · outbound

This paper cites Zeroth-order learning in continuous games via residual pseudogradient estimates.

The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback Zeroth-order learning in continuous games via residual pseudogradient estimates

Reference 17

Resolution: verified exact; arxiv_id, observed 2026-05-10T08:12:25.659227Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 6e829cb5-dc6a-4de4-a0c9-91eef1c08bc6 · outbound

This paper cites B., Nemirovski, A.

The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback B., Nemirovski, A

Reference 18

Resolution: verified exact; doi, observed 2026-05-10T08:12:25.674722Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 068dbcee-c68e-4465-a492-769a975b57ea · outbound

This paper cites A., Hsieh, Y.-P., Sahin, M.

The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback A., Hsieh, Y.-P., Sahin, M

Reference 19

Resolution: verified fuzzy; raw_fallback, observed 2026-05-21T11:24:09.221818Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation ea8dbfc8-dd4a-40b7-a75b-238dd36f7d41 · outbound

This paper cites Efficient learning by implicit exploration in bandit problems with side observations.

The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback Efficient learning by implicit exploration in bandit problems with side observations

Reference 20

Resolution: verified fuzzy; raw_fallback, observed 2026-05-21T11:24:09.234850Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation a051fbc5-1238-4123-865e-eb9f4a4a822c · outbound

This paper cites an unresolved cited work.

The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback Unresolved cited work

Reference 21

Resolution: unresolved; raw_fallback, observed 2026-05-21T11:24:09.236533Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 46281ba9-7164-45a2-a0e5-ed6aa88d79d4 · outbound

This paper cites Model-free learning for two-player zero-sum partially observable Markov games with perfect recall.

The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback Model-free learning for two-player zero-sum partially observable Markov games with perfect recall

Reference 22

Resolution: verified fuzzy; raw_fallback, observed 2026-05-21T11:24:09.242467Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 58069380-5e9b-4a43-bc56-c2db6bec9a70 · outbound

This paper cites Dickerson and Nika Haghtalab and Ariel D.

The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback Dickerson and Nika Haghtalab and Ariel D

Reference 23

Resolution: metadata mismatch; arxiv_id, observed 2026-05-10T08:12:25.677749Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation bebc6f6d-644f-495d-a36e-72c5d233554b · outbound

This paper cites an unresolved cited work.

The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback Unresolved cited work

Reference 24

Resolution: unresolved; raw_fallback, observed 2026-05-21T11:24:09.232642Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 200f8aff-b075-4518-87a2-5a90e0c90a9f · outbound

This paper cites an unresolved cited work.

The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback Unresolved cited work

Reference 25

Resolution: verified exact; doi, observed 2026-05-10T08:12:25.672713Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 74ad897e-c776-49d1-899e-63e721af28f1 · outbound

This paper cites Brève communication.

The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback Brève communication

Reference 26

Resolution: verified exact; doi, observed 2026-05-10T08:12:25.664123Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation ca7da896-12be-4dcd-b60a-097d8b9e9488 · outbound

This paper cites ESCHER: Eschewing Importance Sampling in Games by Computing a History Value Function to Estimate Regret.

The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback ESCHER: Eschewing Importance Sampling in Games by Computing a History Value Function to Estimate Regret

Reference 27

Resolution: verified exact; arxiv_id, observed 2026-05-10T08:12:25.667417Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 1467ffe2-7a6c-4689-8534-04af4702fb87 · outbound

This paper cites G., Rowland, M., Guo, Z.

The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback G., Rowland, M., Guo, Z

Reference 28

Resolution: verified fuzzy; raw_fallback, observed 2026-05-21T11:24:09.241253Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation f78b46c8-b814-4c21-90bf-9292653d957c · outbound

This paper cites On the Impossibility of Convergence of Mixed Strategies with Optimal No - Regret Learning.

The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback On the Impossibility of Convergence of Mixed Strategies with Optimal No - Regret Learning

Reference 29

Resolution: verified exact; arxiv_id, observed 2026-05-10T08:12:25.662256Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 0318a162-72ef-4bed-ba6e-02c46e383329 · outbound

This paper cites an unresolved cited work.

The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback Unresolved cited work

Reference 30

Resolution: unresolved; raw_fallback, observed 2026-05-21T11:24:09.257077Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation bf19085d-2442-4411-a22a-9eb463e68cc5 · outbound

This paper cites Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems.

The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems

Reference 31

Resolution: verified fuzzy; raw_fallback, observed 2026-05-21T11:24:09.225844Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 079be8d5-7f3b-44ef-a4ea-a51b4cfc4406 · outbound

This paper cites and Juditsky, A.

The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback and Juditsky, A

Reference 32

Resolution: metadata mismatch; doi, observed 2026-05-10T08:12:25.670604Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 64f2e9bd-c3c5-4ea2-a817-44b45b4de1d9 · outbound

This paper cites an unresolved cited work.

The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback Unresolved cited work

Reference 33

Resolution: unresolved; raw_fallback, observed 2026-05-21T11:24:09.230393Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 23409493-11fb-49fe-b0cf-1729a3cea05e · outbound

This paper cites Explore no more: improved high-probability regret bounds for non-stochastic bandits.

The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback Explore no more: improved high-probability regret bounds for non-stochastic bandits

Reference 34

Resolution: verified fuzzy; raw_fallback, observed 2026-05-21T11:24:09.218996Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 3d9eba69-1449-4a44-a27d-c50eb151b706 · outbound

This paper cites Information and information stability of random variables and processes.

The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback Information and information stability of random variables and processes

Reference 35

Resolution: verified fuzzy; raw_fallback, observed 2026-05-21T11:24:09.221207Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 070b91c2-8a88-448e-8f17-0279a42b1774 · outbound

This paper cites an unresolved cited work.

The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback Unresolved cited work

Reference 36

Resolution: verified exact; doi, observed 2026-05-10T08:12:25.652279Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation e1146918-de20-4f85-b947-133ab8caa0ed · outbound

This paper cites and Sridharan, K.

The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback and Sridharan, K

Reference 37

Resolution: verified fuzzy; raw_fallback, observed 2026-05-21T11:24:09.223459Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 36e672b9-8492-45cb-8eb4-c5ab2e26e0f5 · outbound

This paper cites Real and Complex Analysis.

The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback Real and Complex Analysis

Reference 38

Resolution: verified fuzzy; raw_fallback, observed 2026-05-21T11:24:09.244929Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 7bc21490-b3db-4179-99d7-5d525336dbd6 · outbound

This paper cites On the Rate of Convergence of Payoff-based Algorithms to Nash Equilibrium in Strongly Monotone Games.

The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback On the Rate of Convergence of Payoff-based Algorithms to Nash Equilibrium in Strongly Monotone Games

Reference 39

Resolution: verified exact; arxiv_id, observed 2026-05-10T08:12:26.633824Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 7c5355f6-4700-4e50-84bf-bbdbe1891c67 · outbound

This paper cites On linear convergence of iterative methods for the variational inequality problem.

The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback On linear convergence of iterative methods for the variational inequality problem

Reference 40

Resolution: verified exact; doi, observed 2026-05-10T08:12:25.650422Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 2d23afaf-0ee5-4faf-b8dd-87cfb72a7ada · outbound

This paper cites Monotone operators and the proximal point algo rithm.

The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback Monotone operators and the proximal point algo rithm

Reference 41

Resolution: verified exact; doi, observed 2026-05-10T08:12:25.654113Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 1a8fc2a1-2973-4346-ae44-c6ae5495cbbc · outbound

This paper cites In: Logics in Artiﬁcial Intelligence , pp.

The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback In: Logics in Artiﬁcial Intelligence , pp

Reference 42

Resolution: verified exact; doi, observed 2026-05-10T08:12:25.656389Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation d9d91d98-1bab-412b-a025-199529f3056f · outbound

This paper cites Last-iterate convergence of decentralized optimistic gradient descent/ascent in infinite-horizon competitive markov games.

The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback Last-iterate convergence of decentralized optimistic gradient descent/ascent in infinite-horizon competitive markov games

Reference 43

Resolution: verified fuzzy; raw_fallback, observed 2026-05-21T11:24:09.259229Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 4d76bea0-e859-4ece-8238-1c291f7aa70c · outbound

This paper cites write newline.

The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback write newline

Reference 44

Resolution: verified fuzzy; raw_fallback, observed 2026-05-21T11:24:09.211380Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Observation 97a42eb7-0bb4-4665-8bf8-746306d4b62f · outbound

This paper cites write newline.

The Harder Path: Last Iterate Convergence for Uncoupled Learning in Zero-Sum Games with Bandit Feedback write newline

Reference 45

Resolution: verified fuzzy; raw_fallback, observed 2026-05-21T11:24:09.216535Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.

Pith citing papers

No inbound Pith citation observations are available.