Hao BMichini C(2024)Inefficiency of pure Nash equilibria in network congestion games: the impact of symmetry and network structureACM Transactions on Economics and Computation10.1145/3665590Online publication date: 28-Jun-2024
https://dl.acm.org/doi/10.1145/3665590
Busch CKannan RTardos EElkind EVohra R(2018)Polynomial Time Equilibria in Bottleneck Congestion GamesProceedings of the 2018 ACM Conference on Economics and Computation10.1145/3219166.3219221(393-409)Online publication date: 11-Jun-2018
https://dl.acm.org/doi/10.1145/3219166.3219221
Chen P(2015)How egalitarian are Nash equilibria in network cost-sharing games?Operations Research Letters10.1016/j.orl.2015.08.00643:6(564-566)Online publication date: 1-Nov-2015
https://dl.acm.org/doi/10.1016/j.orl.2015.08.006
Show More Cited By

Recommendations

Reducing the maximum latency of selfish ring routing via pairwise cooperations
COCOA'10: Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II

This paper studies the selfish routing game in ring networks with a load-dependent linear latency on each link. We adopt the asymmetric atomic routing model. Each player selfishly chooses a route to connect his source-destination pair, aiming at a ...
Pairwise cooperations in selfish ring routing for minimax linear latency

This paper studies the selfish routing game in ring networks with a load-dependent linear latency on each link. We adopt the asymmetric atomic routing model. Each player selfishly chooses a route to connect his source-destination pair, aiming at the ...
Routing selfish unsplittable traffic

We consider general resource assignment games involving selfish users/agents in which users compete for resources and try to be assigned to those which maximize their own benefits (e.g., try to route their traffic through links which minimize the ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

SODA '04: Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms

January 2004

1113 pages

ISBN:089871558X

Program Chair:
Ian Munro

Publisher

Society for Industrial and Applied Mathematics

United States

Publication History

Published: 11 January 2004

Check for updates

Qualifiers

Article

Acceptance Rates

Overall Acceptance Rate 411 of 1,322 submissions, 31%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

16
Total Citations
View Citations
361
Total Downloads

Downloads (Last 12 months)4
Downloads (Last 6 weeks)0

Reflects downloads up to 03 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Hao BMichini C(2024)Inefficiency of pure Nash equilibria in network congestion games: the impact of symmetry and network structureACM Transactions on Economics and Computation10.1145/3665590Online publication date: 28-Jun-2024
https://dl.acm.org/doi/10.1145/3665590
Busch CKannan RTardos EElkind EVohra R(2018)Polynomial Time Equilibria in Bottleneck Congestion GamesProceedings of the 2018 ACM Conference on Economics and Computation10.1145/3219166.3219221(393-409)Online publication date: 11-Jun-2018
https://dl.acm.org/doi/10.1145/3219166.3219221
Chen P(2015)How egalitarian are Nash equilibria in network cost-sharing games?Operations Research Letters10.1016/j.orl.2015.08.00643:6(564-566)Online publication date: 1-Nov-2015
https://dl.acm.org/doi/10.1016/j.orl.2015.08.006
Kannan RBusch C(2010)Bottleneck congestion games with logarithmic price of anarchyProceedings of the Third international conference on Algorithmic game theory10.5555/1929237.1929257(222-233)Online publication date: 18-Oct-2010
https://dl.acm.org/doi/10.5555/1929237.1929257
Busch CMagdon-Ismail M(2009)Atomic routing games on maximum congestionTheoretical Computer Science10.1016/j.tcs.2009.04.015410:36(3337-3347)Online publication date: 1-Aug-2009
https://dl.acm.org/doi/10.1016/j.tcs.2009.04.015
Fischer SVöcking B(2009)Adaptive routing with stale informationTheoretical Computer Science10.1016/j.tcs.2008.01.055410:36(3357-3371)Online publication date: 1-Aug-2009
https://dl.acm.org/doi/10.1016/j.tcs.2008.01.055
Busch CKannan RVasilakos AWang XShroff N(2008)Quality of routing congestion games in wireless sensor networksProceedings of the 4th Annual International Conference on Wireless Internet10.5555/1554126.1554214(1-6)Online publication date: 17-Nov-2008
https://dl.acm.org/doi/10.5555/1554126.1554214
Chen PKempe DFortnow LRiedl JSandholm T(2008)Altruism, selfishness, and spite in traffic routingProceedings of the 9th ACM conference on Electronic commerce10.1145/1386790.1386816(140-149)Online publication date: 8-Jul-2008
https://dl.acm.org/doi/10.1145/1386790.1386816
Roughgarden T(2006)On the severity of Braess's paradoxJournal of Computer and System Sciences10.1016/j.jcss.2005.05.00972:5(922-953)Online publication date: 1-Aug-2006
https://dl.acm.org/doi/10.1016/j.jcss.2005.05.009
Mazalov VMonien BSchoppmann FTiemann K(2006)Wardrop equilibria and price of stability for bottleneck games with splittable trafficProceedings of the Second international conference on Internet and Network Economics10.1007/11944874_30(331-342)Online publication date: 15-Dec-2006
https://dl.acm.org/doi/10.1007/11944874_30
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Recommendations

Reducing the maximum latency of selfish ring routing via pairwise cooperations

Pairwise cooperations in selfish ring routing for minimax linear latency

Routing selfish unsplittable traffic