Bottleneck links, variable demand, and the tragedy of the commons

DOI10.1145/1109557.1109630zbMath1192.91040OpenAlexW4243892127MaRDI QIDQ3581586

Tim Roughgarden, Yevgeniy Dodis, Richard John Cole

Publication date: 16 August 2010

Published in: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1109557.1109630

Mathematics Subject Classification ID

Games involving graphs (91A43)

Related Items (9)

Strong equilibria in games with the lexicographical improvement property ⋮ Bottleneck Routing with Elastic Demands ⋮ Computing pure Nash and strong equilibria in bottleneck congestion games ⋮ On the hardness of network design for bottleneck routing games ⋮ Bottleneck routing with elastic demands ⋮ Characterizing the existence of potential functions in weighted congestion games ⋮ Competitive routing over time ⋮ Congestion Games with Variable Demands ⋮ Edge pricing of multicommodity networks for selfish users with elastic demands

This page was built for publication: Bottleneck links, variable demand, and the tragedy of the commons