mlsanityData to 7 Oct 2026

An Analysis of Logit Learning with the r-Lambert Function

arXiv 2409.05044 ↗First posted 8 Sep 2024eess.SY cs.SYcited by 1

On the map: Offline RL and imitation learning from data → Inverse reinforcement learning

Abstract (arXiv)

The well-known replicator equation in evolutionary game theory describes how population-level behaviors change over time when individuals make decisions using simple imitation learning rules. In this paper, we study evolutionary dynamics based on a fundamentally different class of learning rules known as logit learning. Numerous previous studies on logit dynamics provide numerical evidence of bifurcations of multiple fixed points for several types of games. Our results here provide a more explicit analysis of the logit fixed points and their stability properties for the entire class of two-strategy population games -- by way of the r-Lambert function. We find that for Prisoner's Dilemma and anti-coordination games, there is only a single fixed point for all rationality levels. However, coordination games exhibit a pitchfork bifurcation: there is a single fixed point in a low-rationality regime, and three fixed points in a high-rationality regime. We provide an implicit characterization for the level of rationality where this bifurcation occurs. In all cases, the set of logit fixed points converges to the full set of Nash equilibria in the high rationality limit.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Placed in Inverse reinforcement learning, one of 13 directions in Offline RL and imitation learning from data. First posted on arXiv 8 Sep 2024.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 1.

1 paper.

Similar, not cited

Close in wording, no citation either way

  1. 2026Population-Aware Imitation Learning in Mean-field Games with Common Noise
  2. 2026Near-Optimal Last-Iterate Convergence for Zero-Sum Games with Bandit Feedback and Opponent Actions
  3. 2025Learning Equilibria from Data: Provably Efficient Multi-Agent Imitation Learning
  4. 2026Matching Multiple Experts: On the Exploitability of Multi-Agent Imitation Learning
  5. 2026Bayesian Learning in Episodic Zero-Sum Games
  6. 2023Offline Learning in Markov Games with General Function Approximation
  7. 2024The State-Action-Reward-State-Action Algorithm in Spatial Prisoner's Dilemma Game
  8. 2026Decoding Rewards in Competitive Games: Inverse Game Theory with Entropy Regularization