{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:23:08Z","timestamp":1759638188039},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540681380"},{"type":"electronic","value":"9783540681410"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11944874_9","type":"book-chapter","created":{"date-parts":[[2006,11,27]],"date-time":"2006-11-27T13:41:09Z","timestamp":1164634869000},"page":"87-98","source":"Crossref","is-referenced-by-count":30,"title":["The Equilibrium Existence Problem in Finite Network Congestion Games"],"prefix":"10.1007","author":[{"given":"Igal","family":"Milchtaich","sequence":"first","affiliation":[]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Anantharam, V.: On the Nash Dynamics of Congestion Games With Player-Specific Utility. In: Proceedings of the 43rd IEEE Conference on Decision and Control, pp. 4673\u20134678 (2004)","key":"9_CR1","DOI":"10.1109\/CDC.2004.1429526"},{"doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Azar, Y., Epstein, A.: The Price of Routing Unsplittable Flow. In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, pp. 57\u201366 (2005)","key":"9_CR2","DOI":"10.1145\/1060590.1060599"},{"key":"9_CR3","volume-title":"Studies in the Economics of Transportation","author":"M. Beckmann","year":"1956","unstructured":"Beckmann, M., McGuire, C.B., Winsten, C.B.: Studies in the Economics of Transportation. Yale University Press, New Haven (1956)"},{"doi-asserted-by":"crossref","unstructured":"Christodoulou, G., Koutsoupias, E.: The Price of Anarchy of Finite Congestion Games. In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, pp. 67\u201373 (2005)","key":"9_CR4","DOI":"10.1145\/1060590.1060600"},{"key":"9_CR5","series-title":"Graduate Texts in Mathematics","volume-title":"Graph Theory","author":"R. Diestel","year":"2005","unstructured":"Diestel, R.: Graph Theory, 3rd edn. Graduate Texts in Mathematics, vol.\u00a0173. Springer, Heidelberg (2005)","edition":"3"},{"key":"9_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/3-540-45061-0_41","volume-title":"Automata, Languages and Programming","author":"E. Even-Dar","year":"2003","unstructured":"Even-Dar, E., Kesselman, A., Mansour, Y.: Convergence Time to Nash Equilibria. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 502\u2013513. Springer, Heidelberg (2003)"},{"doi-asserted-by":"crossref","unstructured":"Fabrikant, A., Papadimitriou, C., Talwar, K.: The Complexity of Pure Nash Equilibria. In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing, pp. 604\u2013612 (2004)","key":"9_CR7","DOI":"10.1145\/1007352.1007445"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1007\/978-3-540-27836-8_51","volume-title":"Automata, Languages and Programming","author":"D. Fotakis","year":"2004","unstructured":"Fotakis, D., Kontogiannis, S., Spirakis, P.: Selfish Unsplittable Flows. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 593\u2013605. Springer, Heidelberg (2004)"},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/11671411_13","volume-title":"Approximation and Online Algorithms","author":"D. Fotakis","year":"2006","unstructured":"Fotakis, D., Kontogiannis, S., Spirakis, P.: Symmetry in Network Congestion Games: Pure Equilibria and Anarchy Cost. In: Erlebach, T., Persinao, G. (eds.) WAOA 2005. LNCS, vol.\u00a03879, pp. 161\u2013175. Springer, Heidelberg (2006)"},{"key":"9_CR10","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/S0165-4896(03)00076-3","volume":"46","author":"R. Holzman","year":"2003","unstructured":"Holzman, R., Law-yone (Lev-tov), N.: Network Structure and Strong Equilibrium in Route Selection Games. Math. Social Sci.\u00a046, 193\u2013205 (2003)","journal-title":"Math. Social Sci."},{"key":"9_CR11","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1287\/trsc.1030.0047","volume":"38","author":"H. Konishi","year":"2004","unstructured":"Konishi, H.: Uniqueness of User Equilibrium in Transportation Networks With Heterogeneous Computers. Transportation Sci.\u00a038, 315\u2013330 (2004)","journal-title":"Transportation Sci."},{"key":"9_CR12","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1006\/game.1997.0542","volume":"21","author":"H. Konishi","year":"1997","unstructured":"Konishi, H., Le Breton, M., Weber, S.: Pure Strategy Nash Equilibrium in a Group Formation Game With Positive Externalities. Games Econom. Behav.\u00a021, 161\u2013182 (1997)","journal-title":"Games Econom. Behav."},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1007\/3-540-49116-3_38","volume-title":"STACS 99","author":"E. Koutsoupias","year":"1999","unstructured":"Koutsoupias, E., Papadimitriou, C.: Worst-Case Equilibria. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol.\u00a01563, p. 404. Springer, Heidelberg (1999)"},{"key":"9_CR14","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1023\/A:1016770831869","volume":"17","author":"L. Libman","year":"2001","unstructured":"Libman, L., Orda, A.: Atomic Resource Sharing in Noncooperative Networks. Telecommunication Sys.\u00a017, 385\u2013409 (2001)","journal-title":"Telecommunication Sys."},{"key":"9_CR15","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1006\/game.1996.0027","volume":"13","author":"I. Milchtaich","year":"1996","unstructured":"Milchtaich, I.: Congestion Games With Player-Specific Payoff Functions. Games Econom. Behav.\u00a013, 111\u2013124 (1996)","journal-title":"Games Econom. Behav."},{"key":"9_CR16","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/s001820050086","volume":"27","author":"I. Milchtaich","year":"1998","unstructured":"Milchtaich, I.: Crowding Games are Sequentially Solvable. Internat. J. Game Theory\u00a027, 501\u2013509 (1998)","journal-title":"Internat. J. Game Theory"},{"key":"9_CR17","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1287\/moor.1040.0122","volume":"30","author":"I. Milchtaich","year":"2005","unstructured":"Milchtaich, I.: Topological Conditions for Uniqueness of Equilibrium in Networks. Math. Oper. Res.\u00a030, 225\u2013244 (2005)","journal-title":"Math. Oper. Res."},{"key":"9_CR18","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/j.geb.2005.09.005","volume":"57","author":"I. Milchtaich","year":"2006","unstructured":"Milchtaich, I.: Network Topology and the Efficiency of Equilibrium. Games Econom. Behav.\u00a057, 321\u2013346 (2006)","journal-title":"Games Econom. Behav."},{"key":"9_CR19","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1006\/game.1996.0044","volume":"14","author":"D. Monderer","year":"1996","unstructured":"Monderer, D., Shapley, L.S.: Potential Games. Games Econom. Behav.\u00a014, 124\u2013143 (1996)","journal-title":"Games Econom. Behav."},{"key":"9_CR20","volume-title":"Theory of Games and Economic Behavior","author":"O. Morgenstern","year":"1953","unstructured":"Morgenstern, O., von Neumann, J.: Theory of Games and Economic Behavior, 3rd edn. Princeton University Press, Princeton (1953)","edition":"3"},{"key":"9_CR21","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1016\/j.geb.2003.12.004","volume":"49","author":"S. Morris","year":"2004","unstructured":"Morris, S., Ui, T.: Best Response Equivalence. Games Econom. Behav.\u00a049, 260\u2013287 (2004)","journal-title":"Games Econom. Behav."},{"doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.H.: Algorithms, Games, and the Internet. In: Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, pp. 749\u2013753 (2001)","key":"9_CR22","DOI":"10.1145\/380752.380883"},{"unstructured":"Richman, O., Shimkin, N.: Topological Uniqueness of the Nash Equilibrium for Atomic Selfish Routing. Math. Oper. Res. (forthcoming)","key":"9_CR23"},{"key":"9_CR24","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF01737559","volume":"2","author":"R.W. Rosenthal","year":"1973","unstructured":"Rosenthal, R.W.: A Class of Games Possessing Pure-Strategy Nash Equilibrium. Internat. J. Game Theory\u00a02, 65\u201367 (1973)","journal-title":"Internat. J. Game Theory"},{"key":"9_CR25","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.: The Price of Anarchy is Independent of the Network Topology. J. Comput. System Sci.\u00a067, 341\u2013364 (2003)","journal-title":"J. Comput. System Sci."},{"unstructured":"Roughgarden, T.: Selfish Routing With Atomic Players. In: Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1184\u20131185 (2005)","key":"9_CR26"},{"key":"9_CR27","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1145\/506147.506153","volume":"49","author":"T. Roughgarden","year":"2002","unstructured":"Roughgarden, T., Tardos, \u00c9.: How Bad is Selfish Routing? J. ACM\u00a049, 236\u2013259 (2002)","journal-title":"J. ACM"},{"key":"9_CR28","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1016\/j.geb.2003.06.004","volume":"47","author":"T. Roughgarden","year":"2004","unstructured":"Roughgarden, T., Tardos, \u00c9.: Bounding the Inefficiency of Equilibria in Nonatomic Congestion Games. Games Econom. Behav.\u00a047, 389\u2013403 (2004)","journal-title":"Games Econom. Behav."},{"key":"9_CR29","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/BF01014905","volume":"7","author":"D. Schmeidler","year":"1970","unstructured":"Schmeidler, D.: Equilibrium Points of Nonatomic Games. J. Stat. Phys.\u00a07, 295\u2013300 (1970)","journal-title":"J. Stat. Phys."},{"doi-asserted-by":"crossref","unstructured":"Wardrop, J.G.: Some Theoretical Aspects of Road Traffic Research. In: Proceedings of the Institute of Civil Engineers, Part II, vol.\u00a01, pp. 325\u2013378 (1952)","key":"9_CR30","DOI":"10.1680\/ipeds.1952.11259"}],"container-title":["Lecture Notes in Computer Science","Internet and Network Economics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11944874_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T13:09:12Z","timestamp":1558271352000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11944874_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540681380","9783540681410"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/11944874_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}