{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T12:29:51Z","timestamp":1773232191946,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":29,"publisher":"ACM","license":[{"start":{"date-parts":[[2006,7,30]],"date-time":"2006-07-30T00:00:00Z","timestamp":1154217600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2006,7,30]]},"DOI":"10.1145\/1148109.1148113","type":"proceedings-article","created":{"date-parts":[[2006,10,18]],"date-time":"2006-10-18T22:04:00Z","timestamp":1161209040000},"page":"19-28","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":17,"title":["The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions"],"prefix":"10.1145","author":[{"given":"A.C.","family":"Kaporis","sequence":"first","affiliation":[{"name":"University of Patras, Patras, Greece"}]},{"given":"P.G.","family":"Spirakis","sequence":"additional","affiliation":[{"name":"University of Patras, Patras, Greece"}]}],"member":"320","published-online":{"date-parts":[[2006,7,30]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Dynamic Noncooperative Game Theory","author":"Basar T.","year":"1995","unstructured":"T. Basar and G. J. Olsder . Dynamic Noncooperative Game Theory . Academic Press , London and San Diego, 1995 . T. Basar and G. J. Olsder. Dynamic Noncooperative Game Theory. Academic Press, London and San Diego, 1995."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.266050"},{"key":"e_1_3_2_1_3_1","volume-title":"Handbook of Scheduling","author":"Czumaj A.","year":"2004","unstructured":"A. Czumaj . Selfish routing on the Internet . In J. Leung, editor, Handbook of Scheduling . CRC Press , Boca Raton, FL , 2004 . A. Czumaj. Selfish routing on the Internet. In J. Leung, editor, Handbook of Scheduling. CRC Press, Boca Raton, FL, 2004."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/545381.545436"},{"key":"e_1_3_2_1_5_1","volume-title":"The traffic assignment problem for a general network. Journal of Research of the National Bureau of Standards, 73 B(2):91--118","author":"Dafermos S. C.","year":"1969","unstructured":"S. C. Dafermos and F. T. Sparrow . The traffic assignment problem for a general network. Journal of Research of the National Bureau of Standards, 73 B(2):91--118 , 1969 . S. C. Dafermos and F. T. Sparrow. The traffic assignment problem for a general network. Journal of Research of the National Bureau of Standards, 73 B(2):91--118, 1969."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.11.1.1"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2001.1754"},{"key":"e_1_3_2_1_8_1","volume-title":"ICALP '02: Proceedings of the 29th","author":"Fotakis D.","unstructured":"D. Fotakis , S. C. Kontogiannis , E. Koutsoupias , M. Mavronicolas , and P. G. Spirakis . The structure and complexity of nash equilibria for a selfish routing game . In ICALP '02: Proceedings of the 29th D. Fotakis, S. C. Kontogiannis, E. Koutsoupias, M. Mavronicolas, and P. G. Spirakis. The structure and complexity of nash equilibria for a selfish routing game. In ICALP '02: Proceedings of the 29th"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/850957.854151"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.554730"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/9.557575"},{"key":"e_1_3_2_1_12_1","first-page":"404","article-title":"Worst-case equilibria. (STACS '99) Lecture Notes","volume":"1563","author":"Koutsoupias E.","year":"1999","unstructured":"E. Koutsoupias and C. Papadimitriou . Worst-case equilibria. (STACS '99) Lecture Notes in Computer Science , 1563 : 404 -- 413 , 1999 . E. Koutsoupias and C. Papadimitriou. Worst-case equilibria. (STACS '99) Lecture Notes in Computer Science, 1563:404--413, 1999.","journal-title":"Computer Science"},{"key":"e_1_3_2_1_13_1","first-page":"776","volume-title":"29th International Colloquium (ICALP 2002","author":"Kumar V. S. A.","year":"2002","unstructured":"V. S. A. Kumar and M. V. Marathe . Improved results for stackelberg scheduling strategies. In Automata, Languages and Programming , 29th International Colloquium (ICALP 2002 ), pages 776 -- 787 , 2002 . V. S. A. Kumar and M. V. Marathe. Improved results for stackelberg scheduling strategies. In Automata, Languages and Programming, 29th International Colloquium (ICALP 2002), pages 776--787, 2002."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380846"},{"key":"e_1_3_2_1_15_1","volume-title":"Analysis of Conflict","author":"Myerson R. B.","year":"1991","unstructured":"R. B. Myerson . Game Theory : Analysis of Conflict . Harvard University Press , 1991 . R. B. Myerson. Game Theory: Analysis of Conflict. Harvard University Press, 1991."},{"key":"e_1_3_2_1_16_1","first-page":"1","volume-title":"16th Annual Symposium on Theoretical Aspects of Computer Science","author":"Nisan N.","year":"1999","unstructured":"N. Nisan . Algorithms for selfish agents: Mechanism design for distributed computation . In 16th Annual Symposium on Theoretical Aspects of Computer Science , pages 1 -- 15 , Trier, Germany , 1999 . Springer-Verlag. Lecture Notes in Computer Science, LNCS 1563. N. Nisan. Algorithms for selfish agents: Mechanism design for distributed computation. In 16th Annual Symposium on Theoretical Aspects of Computer Science, pages 1--15, Trier, Germany, 1999. Springer-Verlag. Lecture Notes in Computer Science, LNCS 1563."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/301250.301287"},{"key":"e_1_3_2_1_18_1","volume-title":"A course in Game Theory","author":"Osborne M.","unstructured":"M. Osborne and A. Rubinstein . A course in Game Theory . MIT Press . M. Osborne and A. Rubinstein. A course in Game Theory. MIT Press."},{"key":"e_1_3_2_1_19_1","volume-title":"Game Theory","author":"Owen G.","year":"1995","unstructured":"G. Owen . Game Theory . Academic Press , Orlando, FL , third edition, 1995 . G. Owen. Game Theory. Academic Press, Orlando, FL, third edition, 1995."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380883"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/874063.875606"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/874063.875585"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380783"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509971"},{"key":"e_1_3_2_1_25_1","first-page":"93","volume-title":"Foundations of Computer Science","author":"Roughgarden T.","year":"2002","unstructured":"T. Roughgarden . Selfish Routing . Ph.D dissertation, Cornell University , USA , May 2002 . http:\/\/theory.stanford.edu\/ tim\/ . Foundations of Computer Science , pages 93 -- 102 , 2000. T. Roughgarden. Selfish Routing. Ph.D dissertation, Cornell University, USA, May 2002. http:\/\/theory.stanford.edu\/ tim\/. Foundations of Computer Science, pages 93--102, 2000."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/795666.796571"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.477727"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380783"},{"key":"e_1_3_2_1_29_1","volume-title":"Marktform und Gleichgewicht","author":"von Stackelberg H.","year":"1934","unstructured":"H. von Stackelberg . Marktform und Gleichgewicht . Springer-Verlag , 1934 . H. von Stackelberg. Marktform und Gleichgewicht. Springer-Verlag, 1934."}],"event":{"name":"SPAA06: 18th ACM Symposium on Parallelism in Algorithms and Architectures 2006","location":"Cambridge Massachusetts USA","acronym":"SPAA06","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture"]},"container-title":["Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1148109.1148113","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1148109.1148113","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T23:43:53Z","timestamp":1750290233000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1148109.1148113"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,7,30]]},"references-count":29,"alternative-id":["10.1145\/1148109.1148113","10.1145\/1148109"],"URL":"https:\/\/doi.org\/10.1145\/1148109.1148113","relation":{},"subject":[],"published":{"date-parts":[[2006,7,30]]},"assertion":[{"value":"2006-07-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}