Atomic Routing Games on Maximum Congestion

DOI10.1007/11775096_9zbMath1137.90373OpenAlexW130627994MaRDI QIDQ5434384

Malik Magdon-Ismail, Costas Busch

Publication date: 4 January 2008

Published in: Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11775096_9

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Games involving graphs (91A43)

Related Items (4)

Stability vs. optimality in selfish ring routing ⋮ The price of atomic selfish ring routing ⋮ Efficient graph topologies in network routing games ⋮ Nash equilibria in all-optical networks

This page was built for publication: Atomic Routing Games on Maximum Congestion