Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
Can Reinforcement Learning Find Stackelberg-Nash Equilibria in General-Sum Markov Games with Myopic Followers?
As of 18 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2112.13521.
A citation records a reference. It does not transfer a finding from one paper to another.
Coverage vector
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-18T06:34:40.430872+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-15T23:10:43.997474Z
A source-named dated measurement, never combined with another source.
Source: arxiv_reference, observed 2026-05-10T22:30:49.975645Z
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 8d9ba796-cec7-4eee-b2d5-ecc543e98ed6 · inbound
On Corruption-Robustness in Performative Reinforcement Learning cites this paper.
On Corruption-Robustness in Performative Reinforcement Learning Can Reinforcement Learning Find Stackelberg-Nash Equilibria in General-Sum Markov Games with Myopic Followers?
Reference 57
- Resolution
- unresolved
- no resolver link, observed 2026-08-15T23:10:43.997474Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 397c7713-7dff-4a4c-9669-ab4428628ab2 · inbound
The Sample Complexity of Online Strategic Decision Making with Information Asymmetry and Knowledge Transportability cites this paper.
The Sample Complexity of Online Strategic Decision Making with Information Asymmetry and Knowledge Transportability Can Reinforcement Learning Find Stackelberg-Nash Equilibria in General-Sum Markov Games with Myopic Followers?
Reference 28
- Resolution
- unresolved
- no resolver link, observed 2026-08-07T04:54:05.164140Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 38b35697-364b-4338-8336-d451cc31d168 · inbound
Finite-Time Analysis of Q-Value Iteration for General-Sum Stackelberg Games cites this paper.
Finite-Time Analysis of Q-Value Iteration for General-Sum Stackelberg Games Can Reinforcement Learning Find Stackelberg-Nash Equilibria in General-Sum Markov Games with Myopic Followers?
Reference 27
- Resolution
- verified exact
- arxiv_id, observed 2026-05-10T22:30:49.981507Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.