Routing into two parallel links: Game-theoretic distributed algorithms
From MaRDI portal
Publication:5953220
DOI10.1006/jpdc.2001.1754zbMath0996.68250MaRDI QIDQ5953220
Nahum Shimkin, Eitan Altman, Tania Jiménez, Tamer Başar
Publication date: 27 January 2002
Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/7c3c7d098f0d6ef43c004a4f6f970c06cca5bd4a
68W10: Parallel algorithms in computer science
Related Items
PERFORMANCE OF NON-COOPERATIVE ROUTING OVER PARALLEL NON-OBSERVABLE QUEUES, Game-theoretic static load balancing for distributed systems, Game-theoretic analysis of Internet switching with selfish users, A survey on networking games in telecommunications, The Downs-Thomson paradox: existence, uniqueness and stability of user equilibria, A Survey of Uniqueness Results for Selfish Routing