{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T12:18:22Z","timestamp":1725538702007},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642046445"},{"type":"electronic","value":"9783642046452"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04645-2_31","type":"book-chapter","created":{"date-parts":[[2009,10,7]],"date-time":"2009-10-07T11:14:23Z","timestamp":1254914063000},"page":"347-358","source":"Crossref","is-referenced-by-count":0,"title":["On Equilibria for ADM Minimization Games"],"prefix":"10.1007","author":[{"given":"Leah","family":"Epstein","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Asaf","family":"Levin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"31_CR1","unstructured":"Andelman, N., Feldman, M., Mansour, Y.: Strong price of anarchy. In: Proc. of the 18th Symposium on Discrete Algorithms (SODA 2007), pp. 189\u2013198 (2007)"},{"key":"31_CR2","doi-asserted-by":"crossref","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. In: Proc. of the 45st Annual Symposium on Foundations of Computer Science (FOCS 2004), pp. 295\u2013304 (2004)","DOI":"10.1109\/FOCS.2004.68"},{"key":"31_CR3","first-page":"287","volume-title":"Contributions to the Theory of Games IV, Annals of Mathematics Study 40","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 40, pp. 287\u2013324. Princeton University Press, Princeton (1959)"},{"key":"31_CR4","doi-asserted-by":"publisher","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. Journal of Combinatorial Optimization\u00a06, 425\u2013453 (2002)","journal-title":"Journal of Combinatorial Optimization"},{"key":"31_CR5","volume-title":"Handbook of Scheduling: Algorithms, Models, and Performance Analysis, ch. 42","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, ch. 42. CRC Press, Boca Raton (2004)"},{"key":"31_CR6","unstructured":"Epstein, L., Levin, A.: Better bounds for minimizing SONET ADMs. Journal of Computer and Systems Sciences (to appear)"},{"issue":"3","key":"31_CR7","doi-asserted-by":"publisher","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. Theoretical Computer Science\u00a0349(3), 337\u2013346 (2005)","journal-title":"Theoretical Computer Science"},{"issue":"9","key":"31_CR8","doi-asserted-by":"publisher","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. Computer Networks\u00a052(9), 1721\u20131731 (2008)","journal-title":"Computer Networks"},{"issue":"4","key":"31_CR9","doi-asserted-by":"publisher","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 - Tight bounds for an algorithm without preprocessing. Journal of Parallel and Distributed Computing\u00a067(4), 448\u2013455 (2007)","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"31_CR10","doi-asserted-by":"crossref","unstructured":"Gerstel, O., Lin, P., Sasaki, G.: Wavelength assignment in a WDM ring to minimize cost of embedded SONET rings. In: Proc. INFOCOM 1998, vol.\u00a01, pp. 94\u2013101 (1998)","DOI":"10.1109\/INFCOM.1998.659642"},{"key":"31_CR11","doi-asserted-by":"crossref","unstructured":"Jain, K., Mahdian, M.: Cost sharing. In: Nisan, Roughgarden, Tardos, Vazirani (eds.) Algorithmic game theory, pp. 385\u2013410. Cambridge university press, Cambridge","DOI":"10.1017\/CBO9780511800481.017"},{"key":"31_CR12","doi-asserted-by":"crossref","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 2000), pp. 66\u201374 (2000)","DOI":"10.1109\/SFCS.2000.892066"},{"key":"31_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1007\/3-540-49116-3_38","volume-title":"STACS 99","author":"E. Koutsoupias","year":"1999","unstructured":"Koutsoupias, E., Papadimitriou, C.H.: Worst-case equilibria. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol.\u00a01563, pp. 404\u2013413. Springer, Heidelberg (1999)"},{"key":"31_CR14","doi-asserted-by":"crossref","unstructured":"Liu, L., Li, X., Wan, P.-J., Frieder, O.: Wavelength assignment in WDM rings to minimize SONET ADMs. In: Proc. INFOCOM 2000, vol.\u00a02, pp. 1020\u20131025 (2000)","DOI":"10.1109\/INFCOM.2000.832277"},{"key":"31_CR15","doi-asserted-by":"crossref","unstructured":"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\u2013519 (2001)","DOI":"10.1145\/380752.380846"},{"issue":"4","key":"31_CR16","doi-asserted-by":"publisher","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. Mathematics of Operations Research\u00a04(4), 414\u2013424 (1979)","journal-title":"Mathematics of Operations Research"},{"issue":"2","key":"31_CR17","doi-asserted-by":"publisher","first-page":"286","DOI":"10.2307\/1969529","volume":"54","author":"J. Nash","year":"1951","unstructured":"Nash, J.: Non-cooperative games. Annals of Mathematics\u00a054(2), 286\u2013295 (1951)","journal-title":"Annals of Mathematics"},{"key":"31_CR18","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.H.: Algorithms, games, and the internet. In: Proc. of the 33rd Annual ACM Symposium on Theory of Computing (STOC 2001), pp. 749\u2013753 (2001)","DOI":"10.1145\/380752.380883"},{"issue":"1","key":"31_CR19","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF01737559","volume":"2","author":"R.W. Rosenthal","year":"1973","unstructured":"Rosenthal, R.W.: A class of games possessing pure-strategy Nash equilibria. International Journal of Game Theory\u00a02(1), 65\u201367 (1973)","journal-title":"International Journal of Game Theory"},{"key":"31_CR20","doi-asserted-by":"crossref","unstructured":"Roughgarden, T., Tardos, \u00c9.: How bad is selfish routing? In: Proc. of the 41st Annual Symposium on Foundations of Computer Science (FOCS 2000), pp. 93\u2013102 (2000)","DOI":"10.1109\/SFCS.2000.892069"},{"issue":"6","key":"31_CR21","doi-asserted-by":"publisher","first-page":"1593","DOI":"10.1109\/TNET.2007.906638","volume":"15","author":"M. Shalom","year":"2007","unstructured":"Shalom, M., Zaks, S.: A 10\/7\u2009+\u2009\u03b5 approximation for minimizing the number of ADMs in SONET rings. IEEE\/ACM Transactions on Networking\u00a015(6), 1593\u20131602 (2007)","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"31_CR22","doi-asserted-by":"publisher","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 Journal on Selected Areas in Communications\u00a018, 1995\u20132003 (2000)","journal-title":"IEEE Journal on Selected Areas in Communications"},{"issue":"5","key":"31_CR23","doi-asserted-by":"publisher","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 game theoretic framework for bandwidth allocation and pricing in broadband networks. IEEE\/ACM Transactions on Networking\u00a08(5), 667\u2013678 (2000)","journal-title":"IEEE\/ACM Transactions on Networking"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04645-2_31.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T11:09:46Z","timestamp":1619780986000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04645-2_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642046445","9783642046452"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04645-2_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}