Inequality in Congestion Games with Learning Agents

Dimitris Michailidis, Sennay Ghebreab, Fernando P. Santos
1/28/2026
cs.GTcs.AI

No confident code implementation found for this paper.

Abstract

Who benefits from expanding transport networks? While designed to improve mobility, such interventions can also create inequality. In this paper, we show that disparities arise not only from the structure of the network itself but also from differences in how commuters adapt to it. We model commuters as reinforcement learning agents who adapt their travel choices at different learning rates, reflecting unequal access to resources and information. To capture potential efficiency-fairness tradeoffs, we introduce the Price of Learning (PoL), a measure of inefficiency during learning. We analyze both a stylized network -- inspired in the well-known Braess's paradox, yet with two-source nodes -- and an abstraction of a real-world metro system (Amsterdam). Our simulations show that network expansions can simultaneously increase efficiency and amplify inequality, especially when faster learners disproportionately benefit from new routes before others adapt. These results highlight that transport policies must account not only for equilibrium outcomes but also for the heterogeneous ways commuters adapt, since both shape the balance between efficiency and fairness.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{michailidis2026inequality,
  title  = {Inequality in Congestion Games with Learning Agents},
  author = {Dimitris Michailidis and Sennay Ghebreab and Fernando P. Santos},
  year   = {2026},
  eprint = {2601.20578},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2601.20578v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2601.20578.svg)](https://codeofpaper.com/paper/2601.20578)

Discussion