On Equilibria for ADM Minimization Games

  • Leah Epstein
  • Asaf Levin
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5814)


In the ADM minimization problem, the input is a set of arcs along a directed ring. The input arcs need to be partitioned into non-overlapping chains and cycles so as to minimize the total number of endpoints, where a k-arc cycle contributes k endpoints and a k-arc chain contains k + 1 endpoints. We study ADM minimization problem both as a non-cooperative and a cooperative games. In these games, each arc corresponds to a player, and the players share the cost of the ADM switches. We consider two cost allocation models, a model which was considered by Flammini et al., and a new cost allocation model, which is inspired by congestion games. We compare the price of anarchy and price of stability in the two cost allocation models, as well as the strong price of anarchy and the strong price of stability.


Nash Equilibrium Cooperative Game Cost Allocation Congestion Game Strong Equilibrium 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Andelman, N., Feldman, M., Mansour, Y.: Strong price of anarchy. In: Proc. of the 18th Symposium on Discrete Algorithms (SODA 2007), pp. 189–198 (2007)Google Scholar
  2. 2.
    Anshelevich, E., Dasgupta, A., Kleinberg, J.M., Tardos, É., Wexler, T., Roughgarden, T.: The price of stability for network design with fair cost allocation. In: Proc. of the 45st Annual Symposium on Foundations of Computer Science (FOCS 2004), pp. 295–304 (2004)Google Scholar
  3. 3.
    Aumann, R.J.: Acceptable points in general cooperative n-person games. In: Tucker, A.W., Luce, R.D. (eds.) Contributions to the Theory of Games IV, Annals of Mathematics Study 40, pp. 287–324. Princeton University Press, Princeton (1959)Google Scholar
  4. 4.
    Cǎlinescu, G., Wan, P.-J.: Traffic partition in WDM/SONET rings to minimize SONET ADMs. Journal of Combinatorial Optimization 6, 425–453 (2002)CrossRefMathSciNetGoogle Scholar
  5. 5.
    Czumaj, A.: Selfish routing on the internet. In: Leung, J. (ed.) Handbook of Scheduling: Algorithms, Models, and Performance Analysis, ch. 42. CRC Press, Boca Raton (2004)Google Scholar
  6. 6.
    Epstein, L., Levin, A.: Better bounds for minimizing SONET ADMs. Journal of Computer and Systems Sciences (to appear)Google Scholar
  7. 7.
    Epstein, L., Levin, A.: The chord version for SONET ADMs minimization. Theoretical Computer Science 349(3), 337–346 (2005)zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Flammini, M., Monaco, G., Moscardelli, L., Shalom, M., Zaks, S.: Selfishness, collusion and power of local search for the ADMs minimization problem. Computer Networks 52(9), 1721–1731 (2008)zbMATHCrossRefGoogle Scholar
  9. 9.
    Flammini, M., Shalom, M., Zaks, S.: On minimizing the number of ADMs - Tight bounds for an algorithm without preprocessing. Journal of Parallel and Distributed Computing 67(4), 448–455 (2007)zbMATHCrossRefGoogle Scholar
  10. 10.
    Gerstel, O., Lin, P., Sasaki, G.: Wavelength assignment in a WDM ring to minimize cost of embedded SONET rings. In: Proc. INFOCOM 1998, vol. 1, pp. 94–101 (1998)Google Scholar
  11. 11.
    Jain, K., Mahdian, M.: Cost sharing. In: Nisan, Roughgarden, Tardos, Vazirani (eds.) Algorithmic game theory, pp. 385–410. Cambridge university press, CambridgeGoogle Scholar
  12. 12.
    Karp, R.M., Koutsoupias, E., Papadimitriou, C.H., Shenker, S.: Optimization problems in congestion control. In: Proc. of the 41st Annual Symposium on Foundations of Computer Science (FOCS 2000), pp. 66–74 (2000)Google Scholar
  13. 13.
    Koutsoupias, E., Papadimitriou, C.H.: Worst-case equilibria. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol. 1563, pp. 404–413. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  14. 14.
    Liu, L., Li, X., Wan, P.-J., Frieder, O.: Wavelength assignment in WDM rings to minimize SONET ADMs. In: Proc. INFOCOM 2000, vol. 2, pp. 1020–1025 (2000)Google Scholar
  15. 15.
    Mavronicolas, M., Spirakis, P.G.: The price of selfish routing. In: Proc of the 33rd Annual ACM Symposium on Theory of Computing (STOC 2001), pp. 510–519 (2001)Google Scholar
  16. 16.
    Megiddo, N.: Combinatorial optimization with rational objective functions. Mathematics of Operations Research 4(4), 414–424 (1979)zbMATHCrossRefMathSciNetGoogle Scholar
  17. 17.
    Nash, J.: Non-cooperative games. Annals of Mathematics 54(2), 286–295 (1951)CrossRefMathSciNetGoogle Scholar
  18. 18.
    Papadimitriou, C.H.: Algorithms, games, and the internet. In: Proc. of the 33rd Annual ACM Symposium on Theory of Computing (STOC 2001), pp. 749–753 (2001)Google Scholar
  19. 19.
    Rosenthal, R.W.: A class of games possessing pure-strategy Nash equilibria. International Journal of Game Theory 2(1), 65–67 (1973)zbMATHCrossRefMathSciNetGoogle Scholar
  20. 20.
    Roughgarden, T., Tardos, É.: How bad is selfish routing? In: Proc. of the 41st Annual Symposium on Foundations of Computer Science (FOCS 2000), pp. 93–102 (2000)Google Scholar
  21. 21.
    Shalom, M., Zaks, S.: A 10/7 + ε approximation for minimizing the number of ADMs in SONET rings. IEEE/ACM Transactions on Networking 15(6), 1593–1602 (2007)CrossRefGoogle Scholar
  22. 22.
    Wan, P.-J., Cǎlinescu, G., Liu, L., Frieder, O.: Grooming of arbitrary traffic in SONET/WDM BLSRs. IEEE Journal on Selected Areas in Communications 18, 1995–2003 (2000)CrossRefGoogle Scholar
  23. 23.
    Yaïche, H., Mazumdar, R., Rosenberg, C.: A game theoretic framework for bandwidth allocation and pricing in broadband networks. IEEE/ACM Transactions on Networking 8(5), 667–678 (2000)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Leah Epstein
    • 1
  • Asaf Levin
    • 2
  1. 1.Department of MathematicsUniversity of HaifaHaifaIsrael
  2. 2.Chaya Fellow. Faculty of Industrial Engineering and ManagementThe TechnionHaifaIsrael

Personalised recommendations