{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,2,8]],"date-time":"2024-02-08T09:54:15Z","timestamp":1707386055259},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2006,7,29]],"date-time":"2006-07-29T00:00:00Z","timestamp":1154131200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2006,7,29]],"date-time":"2006-07-29T00:00:00Z","timestamp":1154131200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2007,9]]},"DOI":"10.1007\/s10107-006-0015-2","type":"journal-article","created":{"date-parts":[[2006,7,28]],"date-time":"2006-07-28T06:50:29Z","timestamp":1154069429000},"page":"591-613","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Equilibria for networks with malicious users"],"prefix":"10.1007","volume":"110","author":[{"given":"George","family":"Karakostas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anastasios","family":"Viglas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,7,29]]},"reference":[{"issue":"3","key":"15_CR1","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1137\/0602024","volume":"2","author":"H.Z. Aashtiani","year":"1981","unstructured":"Aashtiani H.Z., Magnanti T.L.(1981). Equilibria on a congested transportation network. SIAM J. Algebraic Discrete Methods 2(3): 213\u2013226","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"15_CR2","unstructured":"Beckmann, M., McGuire, C.B., Winsten, C.B.: Studies in the Economics of Transportation. Yale University Press (1956)"},{"key":"15_CR3","unstructured":"Czumaj, A., V\u00f6cking, B.: Tight bounds for worst-case equilibria. In: Proceedings of the 13th Annual ACM\u2013SIAM Symposium On Discrete Mathematics, pp. 413\u2013420 (2002)"},{"key":"15_CR4","first-page":"91","volume":"73B","author":"S. Dafermos","year":"1969","unstructured":"Dafermos S., Sparrow F.(1969). The traffic assignment problem for a general network. J. Res. Nat. Bureau Standards 73B: 91\u2013118","journal-title":"J. Res. Nat. Bureau Standards"},{"key":"15_CR5","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1002\/net.3230150303","volume":"15","author":"A. Haurie","year":"1985","unstructured":"Haurie A., Marcotte P.(1985). On the relationship between Nash\u2013Cournot and Wardrop equilibria. Networks 15, 295\u2013308","journal-title":"Networks"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Karakostas, G., Viglas, A.: Equilibria for networks with malicious users. In: Proceedings of the 14th Annual International Symposium on Algorithms and Computation (ISAAC), pp. 696\u2013704 (2003)","DOI":"10.1007\/978-3-540-24587-2_71"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Koutsoupias, E., Papadimitriou, C.: Worst-case equilibria. In: Proceedings of the 16th Annual Symposium on Theoretical Aspects of Computer Science, LNCS 1563, pp. 404\u2013413 (1999)","DOI":"10.1007\/3-540-49116-3_38"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"Mavronicolas, M., Spirakis, P.: The price of selfish routing. In: Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, pp. 510\u2013519 (2001)","DOI":"10.1145\/380752.380846"},{"key":"15_CR9","volume-title":"The economics of Welfare","author":"A. Pigou","year":"1920","unstructured":"Pigou A.(1920). The economics of Welfare. Macmillan, London"},{"key":"15_CR10","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"R.T. Rockafellar","year":"1970","unstructured":"Rockafellar R.T.(1970). Convex Analysis. Princeton University Press, New Jersey"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"Roughgarden, T.: Designing networks for selfish users is hard. In: Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science, pp. 472\u2013481 (2001)","DOI":"10.1109\/SFCS.2001.959923"},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"Roughgarden, T.: Stackelberg scheduling strategies. In: Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, pp. 104\u2013113(2001)","DOI":"10.1145\/380752.380783"},{"issue":"2","key":"15_CR13","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1016\/S0022-0000(03)00044-8","volume":"67","author":"T. Roughgarden","year":"2003","unstructured":"Roughgarden T.(2003). The price of anarchy is independent of the network topology. J. Comput. Syst. Sci. 67(2): 341\u2013364","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"15_CR14","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1145\/506147.506153","volume":"49","author":"T. Roughgarden","year":"2002","unstructured":"Roughgarden T., Tardos \u00c9.(2002). How bad is selfish routing?. J. ACM 49(2): 236\u2013259","journal-title":"J. ACM"},{"key":"15_CR15","unstructured":"Schulz, A.S., Stier Moses, N.E.: On the performance of user equilibria in traffic networks. In: 14th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 86\u201387 (2003)"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-006-0015-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-006-0015-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-006-0015-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-006-0015-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,17]],"date-time":"2022-05-17T17:59:59Z","timestamp":1652810399000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-006-0015-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,7,29]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2007,9]]}},"alternative-id":["15"],"URL":"https:\/\/doi.org\/10.1007\/s10107-006-0015-2","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,7,29]]},"assertion":[{"value":"28 September 2004","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 June 2006","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 July 2006","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}