Coordination mechanisms for selfish scheduling

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

Volumn 3828 LNCS, Issue , 2005, Pages 55-69

  Immorlica, Nicole ^a   Li, Li ^b   Mirrokni, Vahab S ^a   Schulz, Andreas ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FUNCTIONS; GAME THEORY; INTELLIGENT AGENTS; JOB ANALYSIS; LINEAR EQUATIONS; MULTIPROCESSING SYSTEMS; NETWORKS (CIRCUITS);

COORDINATION MECHANISMS; GLOBAL OBJECTIVE FUNCTIONS; PROCESSING TIME; STRATEGY PROFILES;

SCHEDULING;

EID: 33744914051     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11600930_7     Document Type: Conference Paper

References (29)

1. Aspnes, Y. Azar, A. Fiat, S. Plotkin, and Waarts. On-line routing of virtual circuits with applications to load balancing and machine scheduling. J. ACM 44, 3, 1997.
2. Y. Azar, J. Naor, and R. Rom. The competitiveness of on-line assignments. Journal of Algorithms, 18:221-237, 1995.
3. A. Bagchi. Stackelberg differential games in economic models. Springer-Verlag, 1984.
4. M. Beckman, C. B. McGuire, and C. B. Winsten. Studies in the Economics of Transportation. Yale University Press, 1956.
5. Sem Borst. User-level performance of channel-aware scheduling algorithms in wireless data networks. IEEE/ACM Transaction on Networking, 13(3):636-647, 2005.
6. G. Christodoulou, E. Koutsoupias, and A. Nanavati. Coordination mechanisms. pages 345-357, Turku, Finland, 12-16 July 2004.
7. R. Cole, Y. Dodis, and T. Roughgarden. How much can taxes help selfish routing? In EC, pages 98-107, 2003.
8. A. Czumaj and B. Vocking. Tight bounds for worst-case equilibria. In SODA, pages 413-420, 2002.
9. E. Davis and J.M. Jaffe. Algorithms for scheduling tasks on unrelated processors. J. ACM, 28(4):721-736, 1981.
10. E. Even-dar, A. Kesselman, and Y. Mansour. Convergence time to nash equilibria. In ICALP, pages 502-513, 2003.
11. G. Finn and E. Horowitz. A linear time approximation algorithm for multiprocessor scheduling. BIT, 19:312-320, 1979.
12. L. Fleischer, K. Jain, and M. Mahdian. Tolls for heterogeneous selfish users in multicommodity networks and generalized congestion games. In FOCS, pages 277-285, 2004.
13. M. Gairing, T. Lucking, M. Mavronicolas, and B. Monien. Computing nash equilibria for scheduling on restricted parallel links. In STOC, pages 613-622, 2004.
14. D. K. Goldenberg, L. Qiu, H. Xie, Y. R. Yang, and Y. Zhang. Optimizing cost and performance for multihoming. SIGCOMM Comput. Commun. Rev., 34(4):79-92, 2004.
15. T. Gonzales, O. Ibarra, and S. Sahni. Bounds for lpt schedules on uniform processors. SIAM Journal of Computing, 6(1):155-166, 1977.
16. Y. Bejerano S.J. Han and L. Li. Fairness and load balancing in wireless LANs. In Proceedings of the 9th annual international conference on Mobile computing and networking (MOBICOM), 2004.
17. O.H. Ibarra and C.E. Kim. Heuristic algorithms for scheduling independent tasks on nonidentical processors. J. ACM, 24(2):280-289, 1977.
18. Y.A. Korilis, A.A. Lazar, and A. Orda. Achieving network optima using Stackelberg routing strategies. IEEE/ACM Transactions on Networking, 5(1):161-173, 1997.
19. E. Koutsoupias and C. Papadimitriou. Worst-case equilibria. In STACS, pages 404-413, 1999.
20. J. Lenstra, D. Shmoys, and É. Tardos. Approximation algorithms for scheduling unrelated parallel machines. Mathematical Programming, 46:259-271, 1990.
21. M. Moulin. On scheduling fees to prevent merging, splitting and transferring of jobs. May 2004.
22. J. P. Nash. Equilibrium points in N-person games. In Proceedings of NAS, 1950.
23. N. Nisan and A. Ronen. Algorithmic mechanism design. In STOC, pages 129-140, 1999.
24. T. Roughgarden. Stackelberg scheduling strategies. In STOC, pages 104-113, 2001.
25. S. Sahni and Y. Cho. Bounds for list schedules on uniform processors. Siam J. of Computing, 9:91-103, 1980.
26. P. Schuurman and T. Vredeveld. Performance guarantees of local search for multiprocessor scheduling. In IPCO, pages 370-382, 2001.
27. S. Suri, C. D. Toth, and Y. Zhou. Selfish load balancing and atomic congestion games. In Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures(SPAA), pages 188-195, 2004.
28. H. von Stackelberg. Marktform und Gleichgewicht. Springer-Verlag, 1934, English translation entitled The Theory of the Market Economy.
29. T. Vredeveld. Combinatorial approximation algorithms. Guaranteed versus experimental performance. 2002. Ph.D. thesis.