{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T10:42:08Z","timestamp":1648550528046},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2011,6,8]],"date-time":"2011-06-08T00:00:00Z","timestamp":1307491200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2012,6]]},"DOI":"10.1007\/s00453-011-9530-5","type":"journal-article","created":{"date-parts":[[2011,6,7]],"date-time":"2011-06-07T15:29:09Z","timestamp":1307460549000},"page":"246-273","source":"Crossref","is-referenced-by-count":0,"title":["On Equilibria for ADM Minimization Games"],"prefix":"10.1007","volume":"63","author":[{"given":"Leah","family":"Epstein","sequence":"first","affiliation":[]},{"given":"Asaf","family":"Levin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,6,8]]},"reference":[{"issue":"2","key":"9530_CR1","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/j.geb.2008.03.005","volume":"65","author":"N. Andelman","year":"2009","unstructured":"Andelman, N., Feldman, M., Mansour, Y.: Strong price of anarchy. Games Econ. Behav. 65(2), 289\u2013317 (2009)","journal-title":"Games Econ. Behav."},{"issue":"4","key":"9530_CR2","doi-asserted-by":"crossref","first-page":"1602","DOI":"10.1137\/070680096","volume":"38","author":"E. Anshelevich","year":"2008","unstructured":"Anshelevich, E., Dasgupta, A., Kleinberg, J.M., Tardos, \u00c9., Wexler, T., Roughgarden, T.: The price of stability for network design with fair cost allocation. SIAM J. Comput. 38(4), 1602\u20131623 (2008)","journal-title":"SIAM J. Comput."},{"key":"9530_CR3","series-title":"Annals of Mathematics Study","first-page":"287","volume-title":"Contributions to the Theory of Games IV","author":"R.J. Aumann","year":"1959","unstructured":"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, vol.\u00a040, pp.\u00a0287\u2013324. Princeton University Press, Princeton (1959)"},{"issue":"1","key":"9530_CR4","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1109\/49.974672","volume":"20","author":"G. C\u01celinescu","year":"2002","unstructured":"C\u01celinescu, G., Frieder, O., Wan, P.-J.: Minimizing electronic line terminals for automatic ring protection in general WDM optical networks. IEEE J. Sel. Areas Commun. 20(1), 183\u2013189 (2002)","journal-title":"IEEE J. Sel. Areas Commun."},{"issue":"4","key":"9530_CR5","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1023\/A:1019525904862","volume":"6","author":"G. C\u01celinescu","year":"2002","unstructured":"C\u01celinescu, G., Wan, P.-J.: Traffic partition in WDM\/SONET rings to minimize SONET ADMs. J.\u00a0Comb. Optim. 6(4), 425\u2013453 (2002)","journal-title":"J.\u00a0Comb. Optim."},{"key":"9530_CR6","volume-title":"Handbook of Scheduling: Algorithms, Models, and Performance Analysis","author":"A. Czumaj","year":"2004","unstructured":"Czumaj, A.: Selfish routing on the Internet. In: Leung, J. (ed.) Handbook of Scheduling: Algorithms, Models, and Performance Analysis. CRC Press, Boca Raton (2004). Chap.\u00a042"},{"issue":"1","key":"9530_CR7","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1109\/49.974671","volume":"20","author":"T. Eilam","year":"2002","unstructured":"Eilam, T., Moran, S., Zaks, S.: Lightpath arrangement in survivable rings to minimize the switching cost. IEEE J. Sel. Areas Commun. 20(1), 172\u2013182 (2002)","journal-title":"IEEE J. Sel. Areas Commun."},{"issue":"2","key":"9530_CR8","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1016\/j.jcss.2008.08.003","volume":"75","author":"L. Epstein","year":"2009","unstructured":"Epstein, L., Levin, A.: Better bounds for minimizing SONET ADMs. J. Comput. Syst. Sci. 75(2), 122\u2013136 (2009)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"9530_CR9","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1016\/j.tcs.2005.07.040","volume":"349","author":"L. Epstein","year":"2005","unstructured":"Epstein, L., Levin, A.: The chord version for SONET ADMs minimization. Theor. Comput. Sci. 349(3), 337\u2013346 (2005)","journal-title":"Theor. Comput. Sci."},{"issue":"1\u20132","key":"9530_CR10","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s00607-009-0072-5","volume":"87","author":"L. Epstein","year":"2010","unstructured":"Epstein, L., Levin, A., Menahem, B.: Minimization of SONET ADMs in ring networks revisited. Computing 87(1\u20132), 3\u201319 (2010)","journal-title":"Computing"},{"key":"9530_CR11","volume-title":"Graph Algorithms","author":"S. Even","year":"1979","unstructured":"Even, S.: Graph Algorithms. Computer Science Press, New York (1979)"},{"issue":"9","key":"9530_CR12","doi-asserted-by":"crossref","first-page":"1721","DOI":"10.1016\/j.comnet.2008.02.009","volume":"52","author":"M. Flammini","year":"2008","unstructured":"Flammini, M., Monaco, G., Moscardelli, L., Shalom, M., Zaks, S.: Selfishness, collusion and power of local search for the ADMs minimization problem. Comput. Netw. 52(9), 1721\u20131731 (2008)","journal-title":"Comput. Netw."},{"issue":"4","key":"9530_CR13","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1016\/j.jpdc.2006.12.002","volume":"67","author":"M. Flammini","year":"2007","unstructured":"Flammini, M., Shalom, M., Zaks, S.: On minimizing the number of ADMs\u2014tight bounds for an algorithm without preprocessing. J. Parallel Distrib. Comput. 67(4), 448\u2013455 (2007)","journal-title":"J. Parallel Distrib. Comput."},{"key":"9530_CR14","first-page":"94","volume-title":"Proc. of the 17th Annual IEEE International Conference on Computer Communications (INFOCOM\u201998)","author":"O. Gerstel","year":"1998","unstructured":"Gerstel, O., Lin, P., Sasaki, G.: Wavelength assignment in a WDM ring to minimize cost of embedded SONET rings. In: Proc. of the 17th Annual IEEE International Conference on Computer Communications (INFOCOM\u201998), pp.\u00a094\u2013101 (1998)"},{"key":"9530_CR15","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1017\/CBO9780511800481.017","volume-title":"Algorithmic Game Theory","author":"K. Jain","year":"2007","unstructured":"Jain, K., Mahdian, M.: Cost sharing. In: N. Nisan, T. Roughgarden, E. Tardos, V.V. Vazirani (eds.) Algorithmic Game Theory, pp.\u00a0385\u2013410. Cambridge University Press, Cambridge (2007)"},{"key":"9530_CR16","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1109\/SFCS.2000.892066","volume-title":"Proc. of the 41st Annual Symposium on Foundations of Computer Science","author":"R.M. Karp","year":"2000","unstructured":"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\u201900), pp.\u00a066\u201374 (2000)"},{"key":"9530_CR17","first-page":"404","volume-title":"Proc. of the 16th Annual Symposium on Theoretical Aspects of Computer Science","author":"E. Koutsoupias","year":"1999","unstructured":"Koutsoupias, E., Papadimitriou, C.H.: Worst-case equilibria. In: Proc. of the 16th Annual Symposium on Theoretical Aspects of Computer Science (STACS\u201999), pp.\u00a0404\u2013413 (1999)"},{"key":"9530_CR18","first-page":"1020","volume-title":"Proc. of the 19th Annual IEEE International Conference on Computer Communications","author":"L. Liu","year":"2000","unstructured":"Liu, L., Li, X.-Y., Wan, P.-J., Frieder, O.: Wavelength assignment in WDM rings to minimize SONET ADMs. In: Proc. of the 19th Annual IEEE International Conference on Computer Communications (INFOCOM\u201900), pp.\u00a01020\u20131025 (2000)"},{"issue":"1","key":"9530_CR19","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/s00453-006-0056-1","volume":"48","author":"M. Mavronicolas","year":"2007","unstructured":"Mavronicolas, M., Spirakis, P.G.: The price of selfish routing. Algorithmica 48(1), 91\u2013126 (2007)","journal-title":"Algorithmica"},{"issue":"4","key":"9530_CR20","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1287\/moor.4.4.414","volume":"4","author":"N. Megiddo","year":"1979","unstructured":"Megiddo, N.: Combinatorial optimization with rational objective functions. Math. Oper. Res. 4(4), 414\u2013424 (1979)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"9530_CR21","doi-asserted-by":"crossref","first-page":"286","DOI":"10.2307\/1969529","volume":"54","author":"J. Nash","year":"1951","unstructured":"Nash, J.: Non-cooperative games. Ann. Math. 54(2), 286\u2013295 (1951)","journal-title":"Ann. Math."},{"key":"9530_CR22","doi-asserted-by":"crossref","first-page":"749","DOI":"10.1145\/380752.380883","volume-title":"Proc. of the 33rd Annual ACM Symposium on Theory of Computing","author":"C.H. Papadimitriou","year":"2001","unstructured":"Papadimitriou, C.H.: Algorithms, games, and the Internet. In: Proc. of the 33rd Annual ACM Symposium on Theory of Computing (STOC\u201901), pp.\u00a0749\u2013753 (2001)"},{"issue":"1","key":"9530_CR23","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/BF01737559","volume":"2","author":"R.W. Rosenthal","year":"1973","unstructured":"Rosenthal, R.W.: A\u00a0class of games possessing pure-strategy Nash equilibria. Int. J. Game Theory 2(1), 65\u201367 (1973)","journal-title":"Int. J. Game Theory"},{"issue":"2","key":"9530_CR24","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1145\/506147.506153","volume":"49","author":"T. Roughgarden","year":"2002","unstructured":"Roughgarden, T., Tardos, \u00c9.: How bad is selfish routing? J. ACM 49(2), 236\u2013259 (2002)","journal-title":"J. ACM"},{"issue":"6","key":"9530_CR25","doi-asserted-by":"crossref","first-page":"1593","DOI":"10.1109\/TNET.2007.906638","volume":"15","author":"M. Shalom","year":"2007","unstructured":"Shalom, M., Zaks, S.: A\u00a010\/7+\u03b5 approximation for minimizing the number of ADMs in SONET rings. IEEE\/ACM Trans. Netw. 15(6), 1593\u20131602 (2007)","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"10","key":"9530_CR26","doi-asserted-by":"crossref","first-page":"1995","DOI":"10.1109\/49.887919","volume":"18","author":"P.-J. Wan","year":"2000","unstructured":"Wan, P.-J., C\u01celinescu, G., Liu, L., Frieder, O.: Grooming of arbitrary traffic in SONET\/WDM BLSRs. IEEE J. Sel. Areas Commun. 18(10), 1995\u20132003 (2000)","journal-title":"IEEE J. Sel. Areas Commun."},{"issue":"5","key":"9530_CR27","doi-asserted-by":"crossref","first-page":"667","DOI":"10.1109\/90.879352","volume":"8","author":"H. Ya\u00efche","year":"2000","unstructured":"Ya\u00efche, H., Mazumdar, R., Rosenberg, C.: A\u00a0game theoretic framework for bandwidth allocation and pricing in broadband networks. IEEE\/ACM Trans. Netw. 8(5), 667\u2013678 (2000)","journal-title":"IEEE\/ACM Trans. Netw."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-011-9530-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-011-9530-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-011-9530-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,24]],"date-time":"2021-11-24T18:57:28Z","timestamp":1637780248000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-011-9530-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,8]]},"references-count":27,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2012,6]]}},"alternative-id":["9530"],"URL":"https:\/\/doi.org\/10.1007\/s00453-011-9530-5","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,6,8]]}}}