Computing Nash equilibria for scheduling on restricted parallel links

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2004, Pages 613-622

  Gairing, Martin ^a   Lücking, Thomas ^a   Mavronicolas, Marios ^b   Monien, Burkhard ^a  

^a UNIVERSITY OF PADERBORN   (Germany)

^b UNIVERSITY OF CYPRUS   (Cyprus)

Author keywords

Approximation algorithms; Machine scheduling; Nash equilibria; Selfish routing; Unsplittable flow

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; PARALLEL PROCESSING SYSTEMS; POLYNOMIALS; PROBLEM SOLVING; ROUTERS;

APPROXIMATION ALGORITHMS; MACHINE SCHEDULING; NASH EQUILIBRIA; SELFISH ROUTING; UNSPLITTABLE FLOW;

SCHEDULING;

EID: 4544276263     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1007352.1007446     Document Type: Conference Paper

References (22)

1. R.K. Ahuja, T.L. Magnanti, and J.B. Orlin. Network flows: theory, algorithms, and applications. Prentice Hall, 1993.
2. 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), pages 413-420, 2002.
3. Y. Dinitz, N. Garg, and M.X. Goemans. On the single-source unsplittable flow problem. In Proc. of the 39th Annual Symposium on Foundations of Computer Science (FOCS'98), pages 290-299, 1998.
4. R. Feldmann, M. Gairing, T. Lücking, B. Monien, and M. Rode. Nashification and the coordination ratio for a selfish routing game. In Proc. of the 30th Int. Colloquium on Automata, Languages, and Programming (ICALP'OS), LNCS 2719, pages 514-526, 2003.
5. R. Feldmann, M. Gairing, T. Lücking, B. Monien, and M. Rode. Selfish routing in non-cooperative networks: A survey. In Proc. of the 28th Int. Symposium on Mathematical Foundations of Computer Science (MFCS'03), LNCS 2747, pages 21-45, 2003.
6. 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 Int. Colloquium on Automata, Languages, and Programming (ICALP'02), LNCS 2380, pages 123-134, 2002.
7. M. Gairing, T. Lücking, M. Mavronicolas, B. Monien, and P. Spirakis. Extreme nash equilibria. In Proc. of the 8th Italian Conference on Theoretical Computer Science (ICTCS'03), LNCS 2841, pages 1-20, 2003, also accepted to Theoretical Computer Science.
8. A.V. Goldberg. Efficient graph algorithms for sequential and parallel computers. PhD Thesis, Department of Electrical Engineering and Computer Science, MIT, 1987.
9. A.V. Goldberg and S. Rao. Beyond the flow decomposition barrier. Journal of the ACM, 45:783-797, 1998.
10. A.V. Goldberg and R.E. Tarjan. A new approach to the maximum-flow problem. Journal of the ACM, 35(4):921-940, 1988.
11. R.L. Graham. Bounds on multiprocessing timing anomalies. SIAM Journal of Applied Mathematics, 17(2):416-429, 1969.
12. E. Horowitz and S. Sahni. Exact and approximate algorithms for scheduling nonidentical processors. Journal of the ACM, 23(2):317-327, 1976.
13. J. Kleinberg. Single-source unsplittable flow. In Proc. of the 37th Annual Symposium on Foundations of Computer Science (FOCS'96), pages 68-77, 1996.
14. S.G. Kolliopoulos and C. Stein. Improved approximation algorithms for unsplittable flow problems. In Proc. of the 88th Annual Symposium on Foundations of Computer Science (FOCS'97), pages 426-435, 1997.
15. S.G. Kolliopoulos and C. Stein. Approximation algorithms for single-source unsplittable flow. SIAM Journal on Computing, 31:919-946, 2002.
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 Int. Symposium on Theoretical Aspects of Computer Science (STACS'99), LNCS 1563, pages 404-413, 1999.
18. J.K. Lenstra, D.B. Shmoys, and E. Tardos. Approximation algorithms for scheduling unrelated parallel machines. Mathematical Programming, 46:259-271, 1990.
19. T. Lücking, M. Mavronicolas, B. Monien, M. Rode, P. Spirakis, and I. Vrto. Which is the worst-case nash equilibrium? In Proc. of the 28th Int. Symposium on Mathematical Foundations of Computer Science (MFCS'03), LNCS 2747, pages 551-561, 2003.
20. R.D. McKelvey and A. McLennan. Computation of equilibria in finite games. In H. Amman, D. Kendrick, and J. Rust, editors, Handbook of Computational Economics, 1996.
21. J. Nash. Non-cooperative games. Annals of Mathematics, 54(2):286-295, 1951.
22. C.H. Papadimitriou. Algorithms, games, and the internet. In Proc. of the 33rd Annual ACM Symposium on Theory of Computing (STOC'01), pages 749-753, 2001.