Atomic routing games on maximum congestion

Theoretical Computer Science

Volumn 410, Issue 36, 2009, Pages 3337-3347

  Busch, Costas ^a   Magdon Ismail, Malik ^b  

^a Louisiana State University   (United States)

^b RENSSELAER POLYTECHNIC INSTITUTE   (United States)

Author keywords

Algorithmic game theory; Congestion game; Nash equilibrium; Price of anarchy; Routing game

Indexed keywords

ALGORITHMIC GAME THEORY; CONGESTION GAME; NASH EQUILIBRIUM; PRICE OF ANARCHY; ROUTING GAME;

ATOMS; COSTS; THREE TERM CONTROL SYSTEMS;

GAME THEORY;

EID: 67651026884     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2009.04.015     Document Type: Article

References (46)

1. Anshelevich E., Dasgupta A., Kleinberg J., Tardos É., Wexler T., and Roughgarden T. The price of stability for network design with fair cost allocation. SIAM Journal on Computing 38 4 (2008) 1602-1623
2. Elliot Anshelevich, Anirban Dasgupta, Éva Tardos, Tom Wexler, Near-optimal network design with selfish agents, in: Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC), San Diego, California, USA, June 2003, pp. 511-520
3. Awerbuch B., Azar Y., and Epstein A. The price of routing unsplittable flow. Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC). Baltimore, MD, USA (May 2005), ACM 57-66
4. Awerbuch B., Azar Y., Richter Y., and Tsur D. Tradeoffs in worst-case equilibria. In: Jansen K., and Solis-Oba R. (Eds). Proceedings of Approximation and Online Algorithms, First International Workshop (2004), Springer 41-52
5. Azar Y., Cohen E., Fiat A., Kaplan H., and Racke H. Optimal oblivious routing in polynomial time. Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC). San Diego, CA (June 2003), ACM Press 383-388
6. Banner R., and Orda A. Bottleneck routing games in communication networks. IEEE Journal on Selected Areas in Communications 25 6 (2007) 1173-1179 Also published in INFOCOM'06
7. P. Berenbrink, C. Scheideler, Locally efficient on-line strategies for routing packets along fixed paths, in: 10th ACM-SIAM Symposium on Discrete Algorithms (SODA), 1999, pp. 112-121
8. Marcin Bienkowski, Miroslaw Korzeniowski, Harald Räcke, A practical algorithm for constructing oblivious routing schemes, in: Proceedings of the 15th Annual ACM Symposium on Parallelism in Algorithms and Architectures, June 2003, pp. 24-33
9. Costas Busch, Rajgopal Kannan, Athanasios V. Vasilakos, Quality of routing congestion games in wireless sensor networks, in: Proc. 4th International Wireless Internet Conference (WICON), Maui, Hawaii, November 2008
10. Christodoulou G., and Koutsoupias E. The price of anarchy of finite congestion games. Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC). Baltimore, MD, USA (May 2005), ACM 67-73
11. Correa J.~R., Schulz A.~S., and Stier Moses N.E. Computational complexity, fairness, and the price of anarchy of the maximum latency problem. Proc. Integer Programming and Combinatorial Optimization, 10th International IPCO Conference. New York, NY, USA. Lecture Notes in Computer Science vol. 3064 (June 2004), Springer 59-73
12. Robert Cypher, Friedhelm Meyer auf der Heide, Christian Scheideler, Berthold Vöcking, Universal algorithms for store-and-forward and wormhole routing, in: Proc. of the 28th ACM Symp. on Theory of Computing, 1996, pp. 356-365
13. Czumaj, and Vocking. Tight bounds for worst-case equilibria. ACM Transactions on Algorithms (TALG) vol. 3 (2007)
14. Artur Czumaj, Piotr Krysta, Berthold Vöcking, Selfish traffic allocation for server farms, in: Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC), Montreal, Quebec, Canada, May 2002, pp. 287-296
15. Fotakis D., Kontogiannis S. C., Koutsoupias E., Mavronicolas M., and Spirakis P. G. The structure and complexity of nash equilibria for a selfish routing game. Proc. Automata, Languages and Programming, 29th International Colloquium, (ICALP). Malaga, Spain. Lecture Notes in Computer Science vol. 2380 (July 2002), Springer 123-134
16. Fotakis D., Kontogiannis S. C., and Spirakis P. G. Selfish unsplittable flows. Theoretical Computer Science 348 2-3 (2005) 226-239
17. Gairing M., Lcking T., Mavronicolas M., and Monien B. The price of anarchy for polynomial social cost. Theoretical Computer Science 369 (2006) 116-135
18. Gairing M., Lcking T., Mavronicolas M., and Monien B. The price of anarchy for restricted parallel links. Parallel Processing Letters (PPL) 16 1 (2006) 117-131
19. Gairing M., Lücking T., Mavronicolas M., Monien B., and Rode M. Nash equilibria in discrete routing games with convex latency functions. Journal of Computer and System Sciences 74 (2008) 1199-1225
20. Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Computing Nash equilibria for scheduling on restricted parallel links, in: Proceedings of the 36th Annual ACM Symposium on the Theory of Computing (STOC), Chicago, Illinois, USA, June 2004, pp. 613-622
21. Gairing M., Lücking T., Mavronicolas M., and Monien B. The price of anarchy for polynomial social cost. Theoretical Computer Science 369 1-3 (2006)
22. Gairing M., Lücking T., Mavronicolas M., Monien B., and Rode M. Nash equilibria in discrete routing games with convex latency functions. Proc. Automata, Languages and Programming: 31st International Colloquium, ICALP. Turku, Finland. Lecture Notes in Computer Science vol. 3142 (July 2004), Springer 645-657
23. Chris Harrelson, Kristen Hildrum, Satish Rao, A polynomial-time tree decomposition to minimize congestion, in: Proceedings of the 15th Annual ACM Symposium on Parallelism in Algorithms and Architectures, June 2003, pp. 34-43
24. M. Hoefer, A. Souza, Tradeoffs and average-case equilibria in selfish routing, in: Proceedings of the 15th European Symposium on Algorithms (ESA 2007), 2007, pp. 63-74
25. M. Hoefer, A. Souza, The influence of link restrictions on (random) selfish routing, in: Proceedings of the First Symposium on Algorithmic Game Theory (SAGT 2008), 2008, pp. 22-32
26. Koutsoupias E., Mavronicolas M., and Spirakis P. G. Approximate equilibria and ball fusion. Theory of Computing System 36 6 (2003) 683-693
27. Koutsoupias E., and Papadimitriou C. Worst-case equilibria. Trier, Germany. LNCS vol. 1563 (March 1999), Springer-Verlag 404-413
28. Leighton F.T., Maggs B.M., and Rao S.B. Packet routing and job-scheduling in O (c o n g e s t i o n + d i l a t i o n) steps. Combinatorica 14 (1994) 167-186
29. Leighton F. T. Introduction to Parallel Algorithms and Architectures: Arrays - Trees - Hypercubes (1992), Morgan Kaufmann, San Mateo
30. Leighton T., Maggs B., and Richa A. W. Fast algorithms for finding O(congestion + dilation) packet routing schedules. Combinatorica 19 (1999) 375-401
31. Libman L., and Orda A. Atomic resource sharing in noncooperative networks. Telecommunication Systems 17 4 (2001) 385-409
32. Lücking T., Mavronicolas M., Monien B., and Rode M. A new model for selfish routing. Theoretical Computer Science 406 3 (2008) 187-206
33. Mavronicolas, and Spirakis. The price of selfish routing. Algorithmica 48 (2007)
34. Vladimir Mazalov, Burkhard Monien, Florian Schoppmann, Karsten Tiemann, Wardrop equilibria and price of stability for bottleneck games with splittable traffic, in: Proceedings of the Workshop on Internet and Network Economics (WINE 2006), 2007, pp. 331-342
35. Menger K. Zur allgemeinen kurventheorie. Fundamenta Mathematicae 10 (1927) 96-115
36. Monderer D., and Shapely L.S. Potential games. Games and Economic Behavior 14 (1996) 124-143
37. 1 + ε N) local control packet switching algorithms, in: Proceedings of the 29th Annual ACM Symposium on the Theory of Computing, New York, May 1997, pp. 644-653
38. Christos Papadimitriou, Algorithms, games, and the Internet, in: ACM, editor, Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (STOC), Hersonissos, Crete, Greece, July 2001, pp. 749-753
39. Yuval Rabani, Éva Tardos, Distributed packet switching in arbitrary networks, in: Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, Philadelphia, Pennsylvania, 22-24 May 1996, pp. 366-375
40. Harald Räcke, Minimizing congestion in general networks, in: Proceedings of the 43rd Annual Symposium on the Foundations of Computer Science, Nov. 2002, pp. 43-52
41. Rosenthal R.W. A class of games possessing pure-strategy Nash equilibria. International Journal of Game Theory 2 (1973) 65-67
42. Tim Roughgarden, The maximum latency of selfish routing, in: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), New Orleans, Louisiana, (USA), January 2004, pp. 980-981
43. Roughgarden T. Selfish routing with atomic players. Proc. 16th Symp. on Discrete Algorithms (SODA) (2005), ACM/SIAM 1184-1185
44. Roughgarden T., and Tardos É. How bad is selfish routing. Journal of the ACM 49 2 (2002) 236-259
45. Roughgarden T., and Tardos É. Bounding the inefficiency of equilibria in nonatomic congestion games. Games and Economic Behavior 47 2 (2004) 389-403
46. Suri S., Toth C. D., and Zhou Y. Selfish load balancing and atomic congestion games. Algorithmica 47 1 (2007) 79-96