Paper Citation Record · LEDGER

Instance-Dependent Regret Bounds for Learning Two-Player Zero-Sum Games with Bandit Feedback

As of 19 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2502.17625.

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

pith.paper-citation-record.v1
2502.17625 v1

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 4 of 4 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-19T06:32:44.657259+00:00

measured 4 of 4 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-16T00:06:35.457448Z

measured 0 of 1 external citation measurements

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

Source: pith, observed 2026-08-07T11:07:06.976028Z

Reference resolution

0 of 0 outbound references displayed

verified exact0
verified fuzzy0
unresolved0
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

No outbound reference observations are available for this paper version.

Pith citing papers

Observation 15d9c5c2-89f1-459a-bfff-0843418cd9b5 · inbound

Sample Complexity of Identifying the Nonredundancy of Nontransitive Games in Dueling Bandits cites this paper.

Sample Complexity of Identifying the Nonredundancy of Nontransitive Games in Dueling Bandits Instance-Dependent Regret Bounds for Learning Two-Player Zero-Sum Games with Bandit Feedback

Reference 13

Resolution: unresolved; no resolver link, observed 2026-08-15T23:26:14.203621Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8aa4244a-7f95-4fe3-8a00-0c655f4cc1ea · inbound

Learning in Matching Games with Bandit Feedback cites this paper.

Learning in Matching Games with Bandit Feedback Instance-Dependent Regret Bounds for Learning Two-Player Zero-Sum Games with Bandit Feedback

Reference 22

Resolution: verified exact; local_arxiv, observed 2026-08-07T11:07:06.980695Z

Source-reported events for the cited work

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

Observation a0eb3204-d47b-4932-989b-f31207c9fd14 · inbound

Probably Correct Optimal Stable Matching under Two-Sided Uncertainty cites this paper.

Probably Correct Optimal Stable Matching under Two-Sided Uncertainty Instance-Dependent Regret Bounds for Learning Two-Player Zero-Sum Games with Bandit Feedback

Reference 27

Resolution: unresolved; no resolver link, observed 2026-07-11T12:55:57.279598Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a5b7a6fa-ae09-471d-b6e5-d7896b1e8a3d · inbound

Decentralized Multi-Player Q-Learning in Episodic Markov Decision Processes with Information Asymmetry cites this paper.

Decentralized Multi-Player Q-Learning in Episodic Markov Decision Processes with Information Asymmetry Instance-Dependent Regret Bounds for Learning Two-Player Zero-Sum Games with Bandit Feedback

Reference 55

Resolution: unresolved; no resolver link, observed 2026-08-16T00:06:35.457448Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.