{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,10]],"date-time":"2025-12-10T08:28:25Z","timestamp":1765355305731,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2006,5,21]],"date-time":"2006-05-21T00:00:00Z","timestamp":1148169600000},"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,5,21]]},"DOI":"10.1145\/1132516.1132529","type":"proceedings-article","created":{"date-parts":[[2006,7,24]],"date-time":"2006-07-24T16:53:01Z","timestamp":1153759981000},"page":"89-98","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":59,"title":["The effect of collusion in congestion games"],"prefix":"10.1145","author":[{"given":"Ara","family":"Hayrapetyan","sequence":"first","affiliation":[{"name":"Cornell University, Ithaca, NY"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u00c9va","family":"Tardos","sequence":"additional","affiliation":[{"name":"Cornell University, Ithaca, NY"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tom","family":"Wexler","sequence":"additional","affiliation":[{"name":"Cornell University, Ithaca, NY"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2006,5,21]]},"reference":[{"journal-title":"Competitive Routing in Networks with Polynomial Costs. IEEE Transactions on Automatic Control, 92--96","year":"2002","author":"Altman E.","key":"e_1_3_2_1_1_1"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.68"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"R. Aumann. Acceptable Points in General Cooperative n-Person Games. Contributions to the Theory of Games IV Princeton University Press 1959.  R. Aumann. Acceptable Points in General Cooperative n-Person Games. Contributions to the Theory of Games IV Princeton University Press 1959.","DOI":"10.1515\/9781400882168-018"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060599"},{"volume-title":"Yale University Press","year":"1956","author":"Beckmann M.","key":"e_1_3_2_1_5_1"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"S. Catoni and S. Pallottino. Traffic Equilibrium Paradoxes. Transportation Science 240--244 1991.  S. Catoni and S. Pallottino. Traffic Equilibrium Paradoxes. Transportation Science 240--244 1991.","DOI":"10.1287\/trsc.25.3.240"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060600"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/11561071_8"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"R. Cominetti J. R. Correa and N. E. Stier-Moses. Network Games with Atomic Players. Columbia Working Paper # DRO-2006-03 2006.  R. Cominetti J. R. Correa and N. E. Stier-Moses. Network Games with Atomic Players. Columbia Working Paper # DRO-2006-03 2006.","DOI":"10.1007\/11786986_46"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/11496915_13"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007445"},{"volume-title":"Collusion-Resistant Mechanisms for Single-Parameter Agents. ACM-SIAM Symposium on Discrete Algorithms, 620--629","year":"2005","author":"Goldberg A. V.","key":"e_1_3_2_1_12_1"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/11527954_3"},{"volume-title":"Worst-Case Equilibria. International Symposium on Theoretical Aspects of Computer Science, 404--413","year":"1999","author":"Koutsoupias E.","key":"e_1_3_2_1_14_1"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"I. Milchtaich. Congestion Games with Player-Specific Payoff Functions. Games and Economic Behavior 111--124 1996.  I. Milchtaich. Congestion Games with Player-Specific Payoff Functions. Games and Economic Behavior 111--124 1996.","DOI":"10.1006\/game.1996.0027"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"D. Monderer and L. S. Shapley. Potential Games. Games and Economic Behavior 124--143 1996.  D. Monderer and L. S. Shapley. Potential Games. Games and Economic Behavior 124--143 1996.","DOI":"10.1006\/game.1996.0044"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"D. Moreno and J. Wooders. Coalition-Proof Equilibrium. Games and Economic Behavior 80--112 1996","DOI":"10.1006\/game.1996.0095"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"H. Moulin and S. Shenker. Strategyproof Sharing of Submodular Costs: Budget Balance Versus Efficiency. Economic Theory 511--533 2001.  H. Moulin and S. Shenker. Strategyproof Sharing of Submodular Costs: Budget Balance Versus Efficiency. Economic Theory 511--533 2001.","DOI":"10.1007\/PL00004200"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.251910"},{"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":"crossref","unstructured":"J. B. Rosen. Existence and Uniqueness of Equilibrium Points for Concave N-Person Games. Econometrica 520--534 1965","DOI":"10.2307\/1911749"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"R. W. Rosenthal. A Class of Games Possessing Pure-Strategy Nash Equilibria. International Journal of Game Theory 65--67 1973","DOI":"10.1007\/BF01737559"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509971"},{"volume-title":"Selfish Routing with Atomic Players. ACM-SIAM Symposium on Discrete Algorithms, 1184--1185","year":"2005","author":"Roughgarden T.","key":"e_1_3_2_1_24_1"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/506147.506153"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007912.1007941"}],"event":{"name":"STOC06: Symposium on Theory of Computing","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Seattle WA USA","acronym":"STOC06"},"container-title":["Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1132516.1132529","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1132516.1132529","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:18:50Z","timestamp":1750263530000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1132516.1132529"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,5,21]]},"references-count":26,"alternative-id":["10.1145\/1132516.1132529","10.1145\/1132516"],"URL":"https:\/\/doi.org\/10.1145\/1132516.1132529","relation":{},"subject":[],"published":{"date-parts":[[2006,5,21]]},"assertion":[{"value":"2006-05-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}