{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,4]],"date-time":"2026-10-04T09:27:39Z","timestamp":1791106059287,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540359043","type":"print"},{"value":"9783540359050","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11786986_44","type":"book-chapter","created":{"date-parts":[[2006,6,28]],"date-time":"2006-06-28T06:46:45Z","timestamp":1151477205000},"page":"501-512","source":"Crossref","is-referenced-by-count":35,"title":["Routing (Un-) Splittable Flow in Games with Player-Specific Linear Latency Functions"],"prefix":"10.1007","author":[{"given":"Martin","family":"Gairing","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Burkhard","family":"Monien","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Karsten","family":"Tiemann","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"44_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/11672142_17","volume-title":"STACS 2006","author":"S. Aland","year":"2006","unstructured":"Aland, S., Dumrauf, D., Gairing, M., Monien, B., Schoppmann, F.: Exact Price of Anarchy for Polynomial Congestion Games. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol.\u00a03884, pp. 218\u2013229. Springer, Heidelberg (2006)"},{"key":"44_CR2","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Azar, Y., Epstein, A.: The Price of Routing Unsplittable Flow. In: Proc.\u00a0of the 37th ACM Symposium on Theory of Computing, pp. 57\u201366 (2005)","DOI":"10.1145\/1060590.1060599"},{"key":"44_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-540-24592-6_4","volume-title":"Approximation and Online Algorithms","author":"B. Awerbuch","year":"2004","unstructured":"Awerbuch, B., Azar, Y., Richter, Y., Tsur, D.: Tradeoffs in Worst-Case Equilibria. In: Solis-Oba, R., Jansen, K. (eds.) WAOA 2003. LNCS, vol.\u00a02909, pp. 41\u201352. Springer, Heidelberg (2004)"},{"key":"44_CR4","unstructured":"Beckmann, M., McGuire, C.B., Winsten, C.B.: Studies in the Economics of Transportation. Yale University Press (1956)"},{"key":"44_CR5","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"S. Boyd","year":"2004","unstructured":"Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)"},{"issue":"3","key":"44_CR6","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1287\/trsc.25.3.240","volume":"25","author":"S. Catoni","year":"1991","unstructured":"Catoni, S., Pallottino, S.: Traffic Equilibrium Paradoxes. Transportation Science\u00a025(3), 240\u2013244 (1991)","journal-title":"Transportation Science"},{"key":"44_CR7","doi-asserted-by":"crossref","unstructured":"Christodoulou, G., Koutsoupias, E.: The Price of Anarchy of Finite Congestion Games. In: Proc.\u00a0of the 37th ACM Symposium on Theory of Computing, pp. 67\u201373 (2005)","DOI":"10.1145\/1060590.1060600"},{"key":"44_CR8","doi-asserted-by":"crossref","unstructured":"Cominetti, R., Correa, J.R., Stier-Moses, N.E.: Network Games With Atomic Players. In: Proc.\u00a0of the 33rd International Colloquium on Automata, Languages, and Programming (to appear, 2006)","DOI":"10.1007\/11786986_46"},{"key":"44_CR9","unstructured":"Czumaj, A., V\u00f6cking, B.: Tight Bounds for Worst-Case Equilibria. In: Proc.\u00a0of the 13th ACM-SIAM Symposium on Discrete Algorithms, pp. 413\u2013420 (2002): Also accepted to Journal of Algorithms as Special Issue of SODA 2002 (2002)"},{"key":"44_CR10","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":"44_CR11","doi-asserted-by":"crossref","unstructured":"Gairing, M., L\u00fccking, T., Mavronicolas, M., Monien, B.: Computing Nash Equilibria for Scheduling on Restricted Parallel Links. In: Proc.\u00a0of the 36th ACM Symposium on Theory of Computing, pp. 613\u2013622 (2004)","DOI":"10.1145\/1007352.1007446"},{"key":"44_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/11523468_5","volume-title":"Automata, Languages and Programming","author":"M. Gairing","year":"2005","unstructured":"Gairing, M., L\u00fccking, T., Monien, B., Tiemann, K.: Nash Equilibria, the Price of Anarchy and the Fully Mixed Nash Equilibrium Conjecture. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 51\u201365. Springer, Heidelberg (2005)"},{"key":"44_CR13","doi-asserted-by":"crossref","unstructured":"Gairing, M., Monien, B., Tiemann, K.: Selfish Routing with Incomplete Information. In: Proc.\u00a0of the 17th ACM Symposium on Parallel Algorithms and Architectures, pp. 203\u2013212 (2005)","DOI":"10.1145\/1073970.1074000"},{"key":"44_CR14","doi-asserted-by":"crossref","unstructured":"Georgiou, C., Pavlides, T., Philippou, A.: Network Uncertainty in Selfish Routing. In: Proc.\u00a0of the 20th IEEE International Parallel & Distributed Processing Symposium (2006)","DOI":"10.1109\/IPDPS.2006.1639342"},{"key":"44_CR15","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1287\/mnsc.14.3.159","volume":"14","author":"J.C. Harsanyi","year":"1967","unstructured":"Harsanyi, J.C.: Games with Incomplete Information Played by Bayesian Players, I, II, III. Management Science\u00a014, 159\u2013182, 320\u2013332, 468\u2013502 (1967)","journal-title":"Management Science"},{"issue":"1","key":"44_CR16","first-page":"191","volume":"20","author":"L.G. Khachiyan","year":"1979","unstructured":"Khachiyan, L.G.: A Polynomial Time Algorithm in Linear Programming. Soviet Mathematics Doklady\u00a020(1), 191\u2013194 (1979)","journal-title":"Soviet Mathematics Doklady"},{"key":"44_CR17","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.H.: Worst-Case Equilibria. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol.\u00a01563, pp. 404\u2013413. Springer, Heidelberg (1999)"},{"issue":"4","key":"44_CR18","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 Systems\u00a017(4), 385\u2013409 (2001)","journal-title":"Telecommunication Systems"},{"issue":"1","key":"44_CR19","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 and Economic Behavior\u00a013(1), 111\u2013124 (1996)","journal-title":"Games and Economic Behavior"},{"key":"44_CR20","unstructured":"Monderer, D.: Multipotential Games. Unpublished manuscript (2005), available at http:\/\/ie.technion.ac.il\/dov\/multipotential_games.pdf"},{"issue":"2","key":"44_CR21","doi-asserted-by":"publisher","first-page":"286","DOI":"10.2307\/1969529","volume":"54","author":"J.F. Nash","year":"1951","unstructured":"Nash, J.F.: Non-Cooperative Games. Annals of Mathematics\u00a054(2), 286\u2013295 (1951)","journal-title":"Annals of Mathematics"},{"issue":"5","key":"44_CR22","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1109\/90.251910","volume":"1","author":"A. Orda","year":"1993","unstructured":"Orda, A., Rom, R., Shimkin, N.: Competitive Routing in Multiuser Communication Networks. IEEE\/ACM Transactions on Networking\u00a01(5), 510\u2013521 (1993)","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"44_CR23","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 Equilibria. International Journal of Game Theory\u00a02, 65\u201367 (1973)","journal-title":"International Journal of Game Theory"},{"key":"44_CR24","volume-title":"Selfish Routing and the Price of Anarchy","author":"T. Roughgarden","year":"2005","unstructured":"Roughgarden, T.: Selfish Routing and the Price of Anarchy. MIT Press, Cambridge (2005)"},{"issue":"2","key":"44_CR25","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? Journal of the ACM\u00a049(2), 236\u2013259 (2002)","journal-title":"Journal of the ACM"},{"key":"44_CR26","doi-asserted-by":"crossref","unstructured":"Wardrop, J.G.: Some Theoretical Aspects of Road Traffic Research. In: Proc.\u00a0of the Institute of Civil Engineers, Pt. II, Vol.\u00a01, pp. 325\u2013378 (1952)","DOI":"10.1680\/ipeds.1952.11362"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11786986_44.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:19:52Z","timestamp":1619493592000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11786986_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540359043","9783540359050"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/11786986_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}