{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T04:13:49Z","timestamp":1776053629712,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540656913","type":"print"},{"value":"9783540491163","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-49116-3_38","type":"book-chapter","created":{"date-parts":[[2007,8,16]],"date-time":"2007-08-16T12:56:14Z","timestamp":1187268974000},"page":"404-413","source":"Crossref","is-referenced-by-count":905,"title":["Worst-Case Equilibria"],"prefix":"10.1007","author":[{"given":"Elias","family":"Koutsoupias","sequence":"first","affiliation":[]},{"given":"Christos","family":"Papadimitriou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,4,12]]},"reference":[{"key":"38_CR1","doi-asserted-by":"crossref","unstructured":"B. Braden, D. Clark, J. Crowcroft, B. Davie, S. Deering, D. Estrin, S. Floyd, V. Jacobson, G. Minshall, C. Partridge, L. Peterson, K. Ramakrishnan, S. Shenker, J. Wroclawski, and L. Zhang. Recommendations on Queue Management and Congestion Avoidance in the Internet, April 1998. http:\/\/info.internet.isi.edu:80\/in-notes\/rfc\/files\/rfc2309.txt","DOI":"10.17487\/rfc2309"},{"issue":"1","key":"38_CR2","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1137\/0209007","volume":"9","author":"Y. Cho","year":"1980","unstructured":"Y. Cho and S. Sahni. Bounds for list schedules on uniform processors. SIAM Journal on Computing, 9(1):91\u2013103, 1980.","journal-title":"SIAM Journal on Computing"},{"key":"38_CR3","unstructured":"S. Floyd and K. Fall. Router Mechanisms to Support End-to-End Congestion Control. Technical report, Lawrence Berkeley National Laboratory, February 1997."},{"key":"38_CR4","unstructured":"G. R. Grimmet and D. R. Stirzaker. Probability and Random Processes, 2nd ed.. Oxford University Press, 1992."},{"issue":"3","key":"38_CR5","doi-asserted-by":"publisher","first-page":"584","DOI":"10.1145\/210346.210415","volume":"42","author":"Y. Korilis","year":"1995","unstructured":"Y. Korilis and A. Lazar. On the existence of equilibria in noncooperative optimal flow control. Journal of the ACM 42(3):584\u2013613, 1995.","journal-title":"Journal of the ACM"},{"key":"38_CR6","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1109\/49.414643","volume":"13","author":"Y. Korilis","year":"1995","unstructured":"Y. Korilis, A. Lazar, A. Orda. Architecting noncooperative networks. IEEE J. Selected Areas of Comm., 13, 7, 1995.","journal-title":"IEEE J. Selected Areas of Comm."},{"key":"38_CR7","unstructured":"R. La, V. Anantharam. Optimal routing control: Game theoretic approach. Proc. 1997 CDC Conf."},{"key":"38_CR8","unstructured":"G. Owen. Game Theory, 3rd ed.. Academic Press, 1995."},{"key":"38_CR9","doi-asserted-by":"crossref","unstructured":"K. Park, M. Sitharam, S. Chen. Quality of service provision in noncooperative network environments. Manuscript, Purdue Univ., 1998.","DOI":"10.1145\/288994.289022"},{"key":"38_CR10","doi-asserted-by":"crossref","unstructured":"C. H. Papadimitriou, M. Yannakakis. On complexity as bounded rationality. In Proceedings of the Twenty-Sixth Annual ACM Symposium on the Theory of Computing. pages 726\u2013733, Montreal, Quebec, Canada, 23\u201325 May 1994.","DOI":"10.1145\/195058.195445"},{"key":"38_CR11","doi-asserted-by":"crossref","unstructured":"S. J. Shenker. Making greed work in networks: a game-theoretic analysis of switch service disciplines. IEEE\/ACM Transactions on Networking, 3(6):819\u2013831, Dec.1995.","DOI":"10.1109\/90.477727"},{"key":"38_CR12","doi-asserted-by":"crossref","unstructured":"S. Shenker, D. Clark, D. Estrin, and S. Herzog. Pricing in Computer Network: Reshaping the Research Agenda. Communications Policy, 20(1), 1996.","DOI":"10.1016\/0308-5961(96)00002-X"}],"container-title":["Lecture Notes in Computer Science","STACS 99"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-49116-3_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T04:42:53Z","timestamp":1556772173000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-49116-3_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540656913","9783540491163"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-49116-3_38","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[1999]]}}}