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
194
Luzi Anderegg, Stephan Eidenbenz · 2003 · 455 citations
The Price of Routing Unsplittable Flow
Baruch Awerbuch, Yossi Azar, Amir Epstein · 2005 · 353 citations
Luzi Anderegg, Stephan Eidenbenz · 2003 · 176 citations
1–5 of 194
398
10
h-index
9
h-index
7
h-index
7
h-index
Institut national de recherche en sciences et technologies du numérique, France
7 publications · 199 citations
7
h-index
1–5 of 398
219
University of California, Berkeley
Berkeley, United States
15 h-index
45 publications
1.3K citations
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
8 h-index
14 publications
449 citations
Technion – Israel Institute of Technology
Haifa, Israel
7 h-index
12 publications
560 citations
Columbia University
New York, United States
7 h-index
21 publications
1.7K citations
University of Southern California
Los Angeles, United States
6 h-index
10 publications
426 citations
Massachusetts Institute of Technology
Cambridge, United States
6 h-index
11 publications
322 citations
University of Illinois Urbana-Champaign
Urbana, United States
6 h-index
10 publications
393 citations
Yale University
New Haven, United States
5 h-index
7 publications
161 citations
1–8 of 219
9 publications · 681 citations
9
h-index
Repository · 5 publications · 77 citations
5
h-index
5 publications · 133 citations
5
h-index
4 publications · 178 citations
4
h-index
4 publications · 189 citations
4
h-index
1–5