Abstract
We consider non cooperative games in all-optical networks where users share the cost of the used ADM switches for realizing given communication patterns. We show that the two fundamental cost sharing methods, Shapley and Egalitarian, induce polynomial converging games with price of anarchy at most 5/3, regardless of the network topology. Such a bound is tight even for rings. Then, we show that if collusion of at most k players is allowed, the Egalitarian method yields polynomially converging games with price of collusion between \({{3}\over{2}}\) and \({{3}\over{2}}+{{1}\over{k}}\). This result is very interesting and quite surprising, as the best known approximation ratio, that is \({{3}\over{2}}+\epsilon\), can be achieved in polynomial time by uncoordinated evolutions of collusion games with coalitions of increasing size. Finally, the Shapley method does not induce well defined collusion games, but can be exploited in the definition of local search algorithms with local optima arbitrarily close to optimal solutions. This would potentially generate PTAS, but unfortunately the arising algorithm might not converge. The determination of new cost sharing methods or local search algorithms reaching a compromise between Shapley and Egalitarian is thus outlined as being a promising and worth pursuing investigating direction.
This research was partly supported by the EU Project “Graphs and Algorithms in Communication Networks (GRAAL)” - COST Action TIST 293.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Anshelevich, E., Dasgupta, A., Tardos, E., Wexler, T.: Near-optimal network design with selfish agents. In: STOC 2003: Proceedings of the thirty-fifth annual ACM symposium on Theory of computing, pp. 511–520. ACM Press, New York (2003)
Brackett, C.A.: Dense wavelength division multiplexing networks: principles and applications. IEEE Journal on Selected Areas in Communications 8, 948–964 (1990)
Chung, N.K., Nosu, K., Winzer, G.: Special issue on dense wdm networks. IEEE Journal on Selected Areas in Communications 8 (1990)
Călinescu, G., Frieder, O., Wan, P.-J.: Minimizing electronic line terminals for automatic ring protection in general wdm optical networks. IEEE Journal of Selected Area on Communications 20(1), 183–189 (2002)
Călinescu, G., Wan, P.-J.: Traffic partition in wdm/sonet rings to minimize sonet adms. Journal of Combinatorial Optimization 6(4), 425–453 (2002)
Czumaj, A., Vocking, B.: Tight bound for the worst-case equilibria. In: Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Mathematics (SODA), pp. 413–420. SIAM (2002)
Du, D.H.C., Vetter, R.J.: Distributed computing with high-speed optical networks. Proceeding of IEEE Computer 26, 8–18 (1993)
Dutta, R., Rouskas, G.N.: Traffic grooming in wdm networks: past and future. IEEE Network, 44–56, November-December (2002)
Eilam, T., Moran, S., Zaks, S.: Lightpath arrangement in survivable rings to minimize the switching cost. IEEE Journal of Selected Area on Communications 20(1), 172–182 (2002)
Epstein, L., Levin, A.: Better bounds for minimizing sonet adms. In: 2nd Workshop on Approximation and Online Algorithms, Bergen, Norway (September 2004)
Fanelli, A., Flammini, M., Melideo, G., Moscardelli, L.: Game theoretical issues in optical networks. In: Proceedings of the 8th International Conference on Transparent Optical Networks (ICTON), Nottingham, United Kingdom, IEEE, Los Alamitos (2006)
Flammini, M., Shalom, M., Zaks, S.: On minimizing the number of adms in a general topology optical network. In: Dolev, S. (ed.) DISC 2006. LNCS, vol. 4167, pp. 459–473. Springer, Heidelberg (2006)
Fotakis, D., Kontogiannis, S.C., Spirakis, P.G.: Atomic congestion games among coalitions. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4051, pp. 572–583. Springer, Heidelberg (2006)
Gerstel, O., Lin, P., Sasaki, G.: Wavelength assignment in a wdm ring to minimize cost of embedded sonet rings. In: INFOCOM 1998, Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies (1998)
Green, P.E.: Fiber-Optic Communication Networks. Prentice Hall, Englewood Cliffs (1992)
Hayrapetyan, A., Tardos, É., Wexler, T.: The effect of collusion in congestion games. In: Kleinberg, J.M. (ed.) STOC, pp. 89–98. ACM, New York (2006)
Klasing, R.: Methods and problems of wavelength-routing in all-optical networks. In: Brim, L., Gruska, J., Zlatuška, J. (eds.) MFCS 1998. LNCS, vol. 1450, pp. 1–9. Springer, Heidelberg (1998)
Mavronicolas, M., Spirakis, P.: The price of selfish routing. In: Proceedings of the 33rd Annual ACM Symposium on the Theory of Computing (STOC), pp. 510–519 (2001)
Nash, J.F.: Equilibrium points in n-person games. Proceedings of the National Academy of Sciences 36, 48–49 (1950)
Roughgarden, T., Tardos, E.: How bad is selfish routing? Journal of ACM 49(2), 236–259 (2002)
Shalom, M., Zaks, S.: A 10/7 + ε approximation scheme for minimizing the number of adms in sonet rings. In: First Annual International Conference on Broadband Networks, San-José, California, USA (October 2004)
Shapley, L.S.: The value of n-person games. Contributions to the theory of games, pp. 31–40, Princeton University Press (1953)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Di Giannantonio, S., Flammini, M., Monaco, G., Moscardelli, L., Shalom, M., Zaks, S. (2007). Selfishness, Collusion and Power of Local Search for the ADMs Minimization Problem . In: Deng, X., Graham, F.C. (eds) Internet and Network Economics. WINE 2007. Lecture Notes in Computer Science, vol 4858. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77105-0_45
Download citation
DOI: https://doi.org/10.1007/978-3-540-77105-0_45
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77104-3
Online ISBN: 978-3-540-77105-0
eBook Packages: Computer ScienceComputer Science (R0)