Routing Games

Routing Games is a mathematical framework in Algorithmic Game Theory that models strategic interactions among self-interested agents selecting paths in a network, distinguished by its focus on equilibrium efficiency and congestion effects arising from shared resource usage.

194

Publications

8.1K

Citations

398

Authors

219

Institutions

Publications per year

2017–2026

43

Authors

398

  1. AM
    Alexandre M. Bayen

    University of California, Berkeley, United States

    10 publications · 184 citations

    10

    h-index

  2. WK
    Walid Krichene

    University of California, Berkeley, United States

    9 publications · 169 citations

    9

    h-index

  3. JR
    Jason R. Marden

    University of Colorado Boulder, United States

    7 publications · 761 citations

    7

    h-index

  4. SA
    Saurabh Amin

    Massachusetts Institute of Technology, United States

    7 publications · 187 citations

    7

    h-index

  5. EA
    Eitan Altman

    Institut national de recherche en sciences et technologies du numérique, France

    7 publications · 199 citations

    7

    h-index

1–5 of 398

Venues

  1. IEEE Transactions on Automatic Control

    9 publications · 681 citations

    9

    h-index

  2. arXiv (Cornell University)

    Repository · 5 publications · 77 citations

    5

    h-index

  3. Mathematics of Operations Research

    5 publications · 133 citations

    5

    h-index

  4. 4

    h-index

  5. 4

    h-index

1–5