Approximating Congestion + Dilation in Networks via "Quality of Routing” Games

DOI10.1109/TC.2011.145zbMath1366.91034OpenAlexW2075468109MaRDI QIDQ5274629

Rajgopal Kannan, Costas Busch, Athanasios V. Vasilakos

Publication date: 12 July 2017

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tc.2011.145

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Games involving graphs (91A43) Applications of game theory (91A80)

Related Items (2)

Bottleneck Congestion Games with Logarithmic Price of Anarchy ⋮ Atomic routing games on maximum congestion

This page was built for publication: Approximating Congestion + Dilation in Networks via "Quality of Routing” Games