Taxes for linear atomic congestion games

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4168 LNCS, Issue , 2006, Pages 184-195

  Caragiannis, Ioannis ^a   Kaklamanis, Christos ^a   Kanellopoulos, Panagiotis ^a  

^a UNIVERSITY OF PATRAS   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

ANIMATION; DATA STRUCTURES; OPTIMAL SYSTEMS; POLYNOMIALS; PROBLEM SOLVING; QUADRATIC PROGRAMMING;

ATOMIC CONGESTION GAMES; LINEAR LATENCY FUNCTIONS; OPTIMAL TOTAL LATENCIES; SYSTEM BEHAVIORS;

THREE DIMENSIONAL COMPUTER GRAPHICS;

EID: 33750697934     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11841036_19     Document Type: Conference Paper

References (24)

1. B. Awerbuch, Y. Azar, and A. Epstein. The price of routing unsplittable flow. In Proc. of the 37th Annual ACM Symposium on Theory of Computing (STOC '05), pp. 57-66, 2005.
2. Y. Azar and A. Epstein, Convex programming for scheduling unrelated parallel machines. In Proc. of the 37th Annual ACM Symposium on Theory of Computing (STOC '05), pp. 331-337, 2005.
3. Y. Azar and A. Epstein. The hardness of network design for unsplittable flow with selfish users. In Proc. of the 3rd Workshop on Approximation and Online Algorithms (WAOA '05), pp. 41-54, 2005.
4. Y. Azar, L. Epstein, Y. Richter, and G. Woeginger. All-norm approximation algorithms. Journal of Algorithms, 52(2): 120-133, 2004.
5. I. Caragiannis, M. Flammini, C. Kaklamanis, P. Kanellopoulos, and L. Moscardelli. Tight bounds for selfish and greedy load balancing. In Proc. of the 33rd International Colloquium on Automata, Languages and Programming (ICALP '06), LNCS 4051, Springer, Part I, pp. 311-322, 2006.
6. G. Christodoulou and E. Koutsoupias. The price of anarchy of finite congestion games. In Proc. of the 37th Annual ACM Symposium,'on Theory of Computing (STOC '05), pp. 67-73, 2005.
7. G. Christodoulou and E. Koutsoupias. On the price of anarchy and stability of correlated equilibria of linear congestion games. In Proc. of the 13th Annual European Symposium on Algorithms (ESA '05), LNCS 3669, Springer, pp. 59-70, 2005.
8. R. Cole, Y. Dodis, and T. Roughgarden. Pricing network edges for heterogeneous selfish users. In Proc. of the 35th Annual ACM Symposium on Theory of Computing (STOC '03), pp. 521-530, 2003.
9. A. Czumaj and B. Vöcking. Tight bounds for worst-case equilibria. In Proc. of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '02), pp. 413-420, 2002.
10. L. Fleischer, K. Jain, and M. Mahdian. Tolls for heterogeneous selfish users in multicommodity networks and generalized congestion games. In Proc. of the 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS '04), pp. 277-285, 2004.
11. D. Fotakis, S. Kontogiannis, E. Koutsoupias, M. Mavronicolas and P. Spirakis. The structure and complexity of Nash equilibria for a selfish routing game. In Proc. of the 29th International Colloquium on Automata, Languages and Programming (ICALP '2), LNCS 2380, Springer, pp. 123-134, 2002.
12. D. Fotakis, S. Kontogiannis, and P. Spirakis. Selfish unsplittable flows. Theoretical Computer Science, 340(3): 514-538, 2005.
13. M. Gairing, T. Lücking, M. Mavronicolas and B. Monien. Computing Nash equilibria for scheduling on restricted parallel links. In Proc. of the 36th Annual ACM Symposium on Theory of Computing (STOC '04), pp. 613-622, 2004.
14. M. Gairing, B. Monien, and K. Tiemann. Routing (un-) splittable flow in games with player-specific latency functions. In Proc. of the 33rd International Colloquium on Automata, Languages and Programming (ICALP '06), LNCS, Springer, 2006, to appear.
15. G. Karakostas, and S. Kolliopoulos. Edge pricing of multicommodity networks for heterogeneous selfish users. In Proc. of the 45th Annual IEEE Symposium on Foundations of Computer Science, (FOCS '04), pp. 268-276, 2004.
16. E. Koutsoupias, M. Mavronicolas and P. Spirakis. Approximate equilibria and ball fusion. Theory of Computing Systems, 36(6): 683-693, 2003.
17. E. Koutsoupias and C. Papadimitriou. Worst-case equilibria. In Proc. of the 16th International Symposium on Theoretical Aspects of Computer Science (STAGS '99), LNCS 1563, Springer, pp. 404-413, 1999.
18. T. Lücking, M. Mavronicolas, B. Monien, and M. Rode. A new model for selfish routing. In Proc. of the 21st International Symposium on Theoretical Aspects of Computer Science (STAGS '04), LNCS 2996, Springer, pp. 547-558, 2004.
19. M. Mavronicolas and P. Spirakis. The price of selfish routing. In Proc. of the 33rd Annual ACM Symposium on Theory of Computing (STOC '01), pp. 510-519, 2001.
20. I. Milchtaich. Congestion games with player-specific payoff functions. Games and Economic Behavior, 13: 111-124, 1996.
21. C. Papadimitriou. Algorithms, games and the internet. In Proc. of the 33rd Annual ACM Symposium on Theory of Computing (STOC '01), pp. 749-753, 2001.
22. R. Rosenthal. A class of games possessing pure-strategy Nash equilibria. International Journal of Game Theory, 2: 65-67, 1973.
23. T. Roughgarden and E. Tardos. How bad is selfish routing? Journal of the ACM, 49(2): 236-259, 2002.
24. S. Suri, C. Tóth and Y. Zhou. Selfish load balancing and atomic congestion games. In Proc. of the 16th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA '04), pp. 188-195, 2004.