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

The paper investigates routing games where travelers choose routes based on remembered or surfaced alternatives rather than a fixed set of actions. It introduces a tractable design theory for endogenous recall, linking a finite‑memory micro model—where each traveler updates a memory state via a logit rule and policies like LRU—to a stationary salience model that assigns route‑specific weights. The authors prove existence and uniqueness of a Forgetful Wardrop Equilibrium, develop algorithms for network design under budget constraints, and identify a Recall Braess Paradox where better recall can worsen equilibrium delay.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.