Endogenous Information in Routing Games: Memory-Constrained Equilibria, Recall Braess Paradoxes, and Memory Design

arXiv:2604.11733 · cs.GT, cs.AI, cs.IT, math.IT · Submitted 2026-04-13 · Read on arXiv

cs.GT, cs.AI, cs.IT, math.IT

Submitted: 2026-04-13

Updated: 2026-09-24

Code: https://github.com/bstabler/TransportationNetworks

Terminology

Forgetful Wardrop Equilibrium — 12× in this paper
Abstraction — 9× in this paper · explained in 1 episode
Accuracy — 8× in this paper · explained in 1 episode
Consistency — 8× in this paper · explained in 3 episodes
Algorithmic Stability — 4× in this paper · explained in 1 episode
Benchmark — 4× in this paper · explained in 2 episodes
Core — 4× in this paper · explained in 2 episodes
Value of Recall — 3× in this paper
Convergence Guarantees — 2× in this paper · explained in 3 episodes
Elias — 2× in this paper · explained in 2 episodes
AI Agents — 1× in this paper · explained in 2 episodes
Agent-Based Simulation — 1× in this paper · explained in 1 episode
Generalization — 1× in this paper · explained in 13 episodes
Inverse Design — 1× in this paper · explained in 2 episodes
Nash Equilibrium — 1× in this paper · explained in 2 episodes
Regularization — 1× in this paper · explained in 3 episodes
Sparsity — 1× in this paper · explained in 4 episodes
Trace — 1× in this paper · explained in 2 episodes
Welfare and the Recall Braess Paradox — 1× in this paper

Sources

Forgetful but Faithful: A Cognitive Memory Architecture and Benchmark for Privacy-Aware Generative Agents

Related papers