{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,2]],"date-time":"2026-09-02T22:53:46Z","timestamp":1788389626251,"version":"build-2803163510"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2012,7,1]],"date-time":"2012-07-01T00:00:00Z","timestamp":1341100800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Comput. Sci. Technol."],"published-print":{"date-parts":[[2012,7]]},"DOI":"10.1007\/s11390-012-1257-5","type":"journal-article","created":{"date-parts":[[2012,7,13]],"date-time":"2012-07-13T08:31:36Z","timestamp":1342168296000},"page":"710-717","source":"Crossref","is-referenced-by-count":8,"title":["Worst-Case Nash Equilibria in Restricted Routing"],"prefix":"10.1007","volume":"27","author":[{"given":"Pin-Yan","family":"Lu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chang-Yuan","family":"Yu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2012,7,12]]},"reference":[{"key":"1257_CR1","doi-asserted-by":"crossref","unstructured":"Koutsoupias E, Papadimitriou C\u00a0H. Worst-case equilibria. In Proc. the 16th STACS, February 1999, pp.404\u2013413.","DOI":"10.1007\/3-540-49116-3_38"},{"key":"1257_CR2","unstructured":"Czumaj A, V\u00f6cking B. Tight bounds for worst-case equilibria. In Proc. the 13th SODA, January 2002, pp.413\u2013420."},{"issue":"2","key":"1257_CR3","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1016\/j.tcs.2006.05.010","volume":"361","author":"B Awerbuch","year":"2006","unstructured":"Awerbuch B, Azar Y, Richter Y et al. Tradeoffs in worst-case equilibria. Theor. Comput. Sci., 2006, 361(2): 200\u2013209.","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"1257_CR4","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1142\/S0129626406002514","volume":"16","author":"M Gairing","year":"2006","unstructured":"Gairing M, Lucking T, Mavronicolas M, Monien B. The price of anarchy for restricted parallel links. Parallel Processing Letters, 2006, 16(1): 117\u2013132.","journal-title":"Parallel Processing Letters"},{"issue":"36","key":"1257_CR5","doi-asserted-by":"crossref","first-page":"3327","DOI":"10.1016\/j.tcs.2009.01.005","volume":"410","author":"G Christodoulou","year":"2009","unstructured":"Christodoulou G, Koutsoupias E, Nanavati A. Coordination mechanisms. Theor. Comput. Sci., 2009, 410(36): 3327\u20133336.","journal-title":"Theor. Comput. Sci."},{"key":"1257_CR6","unstructured":"Azar Y, Jain K, Mirrokni V. (Almost) optimal coordination mechanisms for unrelated machine scheduling. In Proc. the 19th SODA, January 2008, pp.323\u2013332."},{"key":"1257_CR7","doi-asserted-by":"crossref","unstructured":"Wardrop J\u00a0G. Some theoretical aspects of road traffic research. Proc. Inst. Civil Engineers, 1952, Pt. II, 1: 325\u2013378.","DOI":"10.1680\/ipeds.1952.11259"},{"key":"1257_CR8","doi-asserted-by":"crossref","unstructured":"Roughgarden T, Tardos \u00c9. How bad is selfish routing? In Proc. the 41st FOCS, November 2000, pp.93\u2013102.","DOI":"10.1109\/SFCS.2000.892069"},{"key":"1257_CR9","doi-asserted-by":"crossref","unstructured":"Roughgarden T, Stackelberg scheduling strategies. In Proc. the 33rd STOC, July 2001, pp.104\u2013113.","DOI":"10.1145\/380752.380783"},{"key":"1257_CR10","doi-asserted-by":"crossref","unstructured":"Roughgarden T. The price of anarchy is independent of the network topology. In Proc. the 34th STOC, May 2002, pp.428\u2013437.","DOI":"10.1145\/509967.509971"},{"key":"1257_CR11","unstructured":"Roughgarden T, Tardos \u00c9. Bounding the inefficiency of equilibria in nonatomic congestion games. Technical Report TR 2002\u20131866, Cornell University, 2002."},{"key":"1257_CR12","unstructured":"Schulz A S, Moses N\u00a0S. On the performance of user equilibria in traffic networks. In Proc. the 43th SODA, January 2003, pp.86\u201387."},{"key":"1257_CR13","doi-asserted-by":"crossref","unstructured":"ImmorlicaN, Li L, Mirrokni V, Schulz A. Coordinationmechanisms for selfish scheduling. In Proc. WINE, December 2005, pp.55\u201369.","DOI":"10.1007\/11600930_7"},{"issue":"3","key":"1257_CR14","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1007\/BF01930985","volume":"19","author":"G Finn","year":"1979","unstructured":"Finn G, Horowitz E. A linear time approximation algorithm for multiprocessor scheduling. BIT Numerical Mathematics, 1979, 19(3): 312\u2013320.","journal-title":"BIT Numerical Mathematics"},{"key":"1257_CR15","unstructured":"Vredeveld T. Combinatorial approximation algorithms: Guaranteed versus experimental performance [Ph.D. Thesis]. Department of Mathematics and Computer Science, Eindhoven University of Technology, 2002."},{"issue":"3","key":"1257_CR16","doi-asserted-by":"crossref","first-page":"486","DOI":"10.1145\/258128.258201","volume":"44","author":"J Aspnes","year":"1997","unstructured":"Aspnes J, Azar Y, Fiat A, Plotkin S, Waarts O. On-line routing of virtual circuits with applications to load balancing and machine scheduling. J. ACM, 1997, 44(3): 486\u2013504.","journal-title":"J. ACM"},{"issue":"2","key":"1257_CR17","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1006\/jagm.1995.1008","volume":"18","author":"Y Azar","year":"1995","unstructured":"Azar Y, Naor J, Rom R. The competitiveness of on-line assignments. Journal of Algorithms, 1995, 18(2): 221\u2013237.","journal-title":"Journal of Algorithms"},{"key":"1257_CR18","doi-asserted-by":"crossref","unstructured":"Gairing M, Lucking T, Mavronicolas M, Monien B. Computing Nash equilibria for scheduling on restricted parallel links. In Proc. the 36th STOC, June 2004, pp.613\u2013622.","DOI":"10.1145\/1007352.1007446"},{"key":"1257_CR19","doi-asserted-by":"crossref","unstructured":"Fotakis D, Kontogiannis S, Koutsoupias E, Mavronicolas M, Spirakis P. The structure and complexity of Nash equilibria for a selfish routing game. In Proc. the 29th ICALP, July 2002, pp.123\u2013134.","DOI":"10.1007\/3-540-45465-9_12"}],"container-title":["Journal of Computer Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-012-1257-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11390-012-1257-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-012-1257-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T23:31:13Z","timestamp":1743723073000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11390-012-1257-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7]]},"references-count":19,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2012,7]]}},"alternative-id":["1257"],"URL":"https:\/\/doi.org\/10.1007\/s11390-012-1257-5","relation":{},"ISSN":["1000-9000","1860-4749"],"issn-type":[{"value":"1000-9000","type":"print"},{"value":"1860-4749","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,7]]}}}