Queueing Network Games
Queueing Network Games is a class of stochastic game models in which strategic agents compete or cooperate over shared resources within a network of interconnected queues, distinguished by the integration of queueing theory dynamics—such as arrival, service, and routing processes—with non-cooperative game-theoretic decision-making among rational players.
55
Publications
1.9K
Citations
128
Authors
89
Institutions
Publications per year
2017–2026
18
Parents
55
Source models of network game traffic
Michael S. Borella · Computer Communications · 2000 · 166 citations
A paradox of congestion in a queuing network
Joel E. Cohen, F. P. Kelly · Journal of Applied Probability · 1990 · 163 citations
1–5 of 55
128
4
h-index
3
h-index
3
h-index
2
h-index
2
h-index
1–5 of 128
89
University of Illinois Urbana-Champaign
Urbana, United States
4 h-index
8 publications
146 citations

University of Massachusetts Amherst
Amherst Center, United States
4 h-index
9 publications
464 citations

Tel Aviv University
Tel Aviv, Israel
3 h-index
5 publications
190 citations
Technion – Israel Institute of Technology
Haifa, Israel
3 h-index
5 publications
122 citations
University of California, Berkeley
Berkeley, United States
3 h-index
6 publications
78 citations
Kyung Hee University
Seoul, South Korea
2 h-index
2 publications
50 citations
University of Houston
Houston, United States
2 h-index
2 publications
43 citations

Chinese Academy of Sciences
Beijing, China
2 h-index
4 publications
99 citations
1–8 of 89
4 publications · 221 citations
4
h-index
3 publications · 87 citations
3
h-index
POMS · 2 publications · 124 citations
2
h-index
2 publications · 41 citations
2
h-index
JAP · 2 publications · 186 citations
2
h-index
1–5