Skip to main content

Coordination Mechanisms for Selfish Scheduling

  • Conference paper
Internet and Network Economics (WINE 2005)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 3828))

Included in the following conference series:

  • 2139 Accesses

Abstract

In machine scheduling, a set of n jobs must be scheduled on a set of m machines. Each job i incurs a processing time of p ij on machine j and the goal is to schedule jobs so as to minimize some global objective function, such as the maximum makespan of the schedule considered in this paper. Often in practice, each job is controlled by an independent selfish agent who chooses to schedule his job on machine which minimizes the (expected) completion time of his job. This scenario can be formalized as a game in which the players are job owners; the strategies are machines; and the disutility to each player in a strategy profile is the completion time of his job in the corresponding schedule (a player’s objective is to minimize his disutility). The equilibria of these games may result in larger-than-optimal overall makespan. The ratio of the worst-case equilibrium makespan to the optimal makespan is called the price of anarchy of the game. In this paper, we design and analyze scheduling policies, or coordination mechanisms, for machines which aim to minimize the price of anarchy (restricted to pure Nash equilibria) of the corresponding game. We study coordination mechanisms for four classes of multiprocessor machine scheduling problems and derive upper and lower bounds for the price of anarchy of these mechanisms. For several of the proposed mechanisms, we also are able to prove that the system converges to a pure Nash equilibrium in a linear number of rounds. Finally, we note that our results are applicable to several practical problems arising in networking.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Aspnes, J., Azar, Y., Fiat, A., Plotkin, S., Waarts, O.: On-line routing of virtual circuits with applications to load balancing and machine scheduling. J. ACM 44(3) (1997)

    Google Scholar 

  2. Azar, Y., Naor, J., Rom, R.: The competitiveness of on-line assignments. Journal of Algorithms 18, 221–237 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  3. Bagchi, A.: Stackelberg differential games in economic models. Springer, Heidelberg (1984)

    Book  MATH  Google Scholar 

  4. Beckman, M., McGuire, C.B., Winsten, C.B.: Studies in the Economics of Transportation. Yale University Press, New Haven (1956)

    Google Scholar 

  5. Borst, S.: User-level performance of channel-aware scheduling algorithms in wireless data networks. IEEE/ACM Transaction on Networking 13(3), 636–647 (2005)

    Article  Google Scholar 

  6. Christodoulou, G., Koutsoupias, E., Nanavati, A.: Coordination mechanisms, Turku, Finland, July 12-16, pp. 345–357 (2004)

    Google Scholar 

  7. Cole, R., Dodis, Y., Roughgarden, T.: How much can taxes help selfish routing? In: EC, pp. 98–107 (2003)

    Google Scholar 

  8. Czumaj, A., Vocking, B.: Tight bounds for worst-case equilibria. In: SODA, pp. 413–420 (2002)

    Google Scholar 

  9. Davis, E., Jaffe, J.M.: Algorithms for scheduling tasks on unrelated processors. J. ACM 28(4), 721–736 (1981)

    Article  MATH  MathSciNet  Google Scholar 

  10. Even-dar, E., Kesselman, A., Mansour, Y.: Convergence time to nash equilibria. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 502–513. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  11. Finn, G., Horowitz, E.: A linear time approximation algorithm for multiprocessor scheduling. BIT 19, 312–320 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  12. Fleischer, L., Jain, K., Mahdian, M.: Tolls for heterogeneous selfish users in multicommodity networks and generalized congestion games. In: FOCS, pp. 277–285 (2004)

    Google Scholar 

  13. Gairing, M., Lucking, T., Mavronicolas, M., Monien, B.: Computing nash equilibria for scheduling on restricted parallel links. In: STOC, pp. 613–622 (2004)

    Google Scholar 

  14. Goldenberg, D.K., Qiu, L., Xie, H., Yang, Y.R., Zhang, Y.: Optimizing cost and performance for multihoming. SIGCOMM Comput. Commun. Rev. 34(4), 79–92 (2004)

    Article  Google Scholar 

  15. Gonzales, T., Ibarra, O., Sahni, S.: Bounds for lpt schedules on uniform processors. SIAM Journal of Computing 6(1), 155–166 (1977)

    Article  Google Scholar 

  16. Bejerano, Y., Han, S.J., Li, L.: Fairness and load balancing in wireless LANs. In: Proceedings of the 9th annual international conference on Mobile computing and networking, MOBICOM (2004)

    Google Scholar 

  17. Ibarra, O.H., Kim, C.E.: Heuristic algorithms for scheduling independent tasks on nonidentical processors. J. ACM 24(2), 280–289 (1977)

    Article  MATH  MathSciNet  Google Scholar 

  18. Korilis, Y.A., Lazar, A.A., Orda, A.: Achieving network optima using Stackelberg routing strategies. IEEE/ACM Transactions on Networking 5(1), 161–173 (1997)

    Article  Google Scholar 

  19. Koutsoupias, E., Papadimitriou, C.: Worst-case equilibria. In: STACS, pp. 404–413 (1999)

    Google Scholar 

  20. Lenstra, J., Shmoys, D., Tardos, É.: Approximation algorithms for scheduling unrelated parallel machines. Mathematical Programming 46, 259–271 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  21. Moulin, H.: On scheduling fees to prevent merging, splitting and transferring of jobs (May 2004)

    Google Scholar 

  22. Nash, J.F.: Equilibrium points in N-person games. In: Proceedings of NAS (1950)

    Google Scholar 

  23. Nisan, N., Ronen, A.: Algorithmic mechanism design. In: STOC, pp. 129–140 (1999)

    Google Scholar 

  24. Roughgarden, T.: Stackelberg scheduling strategies. In: STOC, pp. 104–113 (2001)

    Google Scholar 

  25. Sahni, S., Cho, Y.: Bounds for list schedules on uniform processors. Siam J. of Computing 9, 91–103 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  26. Schuurman, P., Vredeveld, T.: Performance guarantees of local search for multiprocessor scheduling. In: Aardal, K., Gerards, B. (eds.) IPCO 2001. LNCS, vol. 2081, pp. 370–382. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  27. Suri, S., Toth, C.D., Zhou, Y.: Selfish load balancing and atomic congestion games. In: Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures(SPAA), pp. 188–195 (2004)

    Google Scholar 

  28. von Stackelberg, H.: Marktform und Gleichgewicht. Springer, Heidelberg (1934); English translation entitled The Theory of the Market Economy

    Google Scholar 

  29. Vredeveld, T.: Combinatorial approximation algorithms. Guaranteed versus experimental performance, Ph.D. thesis (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Immorlica, N., Li, L., Mirrokni, V.S., Schulz, A. (2005). Coordination Mechanisms for Selfish Scheduling. In: Deng, X., Ye, Y. (eds) Internet and Network Economics. WINE 2005. Lecture Notes in Computer Science, vol 3828. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11600930_7

Download citation

  • DOI: https://doi.org/10.1007/11600930_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-30900-0

  • Online ISBN: 978-3-540-32293-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics