{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:28:47Z","timestamp":1725474527432},"publisher-location":"Berlin, Heidelberg","reference-count":25,"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_30","type":"book-chapter","created":{"date-parts":[[2006,11,27]],"date-time":"2006-11-27T13:41:09Z","timestamp":1164634869000},"page":"331-342","source":"Crossref","is-referenced-by-count":8,"title":["Wardrop Equilibria and Price of Stability for Bottleneck Games with Splittable Traffic"],"prefix":"10.1007","author":[{"given":"Vladimir","family":"Mazalov","sequence":"first","affiliation":[]},{"given":"Burkhard","family":"Monien","sequence":"additional","affiliation":[]},{"given":"Florian","family":"Schoppmann","sequence":"additional","affiliation":[]},{"given":"Karsten","family":"Tiemann","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"30_CR1","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"R.K. Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Englewood Cliffs (1993)"},{"key":"30_CR2","unstructured":"Anshelevich, E., Dasgupta, A., Kleinberg, J., Roughgarden, T., Tardos, \u00c9., Wexler, T.: The Price of Stability for Network Design with Fair Cost Allocation. In: Proc.\u00a0of the 45th Annual Symposium on Foundations of Computer Science (FOCS 2004) (2004)"},{"key":"30_CR3","unstructured":"Banner, R., Orda, A.: Bottleneck Routing Games in Communication Networks. In: Proc.\u00a0of the 25th Conference on Computer Communications (INFOCOM 2006) (to appear, 2006)"},{"key":"30_CR4","unstructured":"Beckmann, M., McGuire, C.B., Winsten, C.B.: Studies in the Economics of Transportation. Yale University Press (1956)"},{"key":"30_CR5","volume-title":"Data Networks","author":"D. Bertsekas","year":"1987","unstructured":"Bertsekas, D., Gallager, R.: Data Networks. Prentice-Hall, Englewood Cliffs (1987)"},{"key":"30_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/11775096_9","volume-title":"Algorithmic Aspects in Information and Management","author":"C. Busch","year":"2006","unstructured":"Busch, C., Magdon-Ismail, M.: Atomic Routing Games on Maximum Congestion. In: Cheng, S.-W., Poon, C.K. (eds.) AAIM 2006. LNCS, vol.\u00a04041, pp. 79\u201391. Springer, Heidelberg (2006)"},{"key":"30_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"809","DOI":"10.1007\/11602613_81","volume-title":"Algorithms and Computation","author":"I. Caragiannis","year":"2005","unstructured":"Caragiannis, I., Galdi, C., Kaklamanis, C.: Network Load Games. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol.\u00a03827, pp. 809\u2013818. Springer, Heidelberg (2005)"},{"key":"30_CR8","doi-asserted-by":"crossref","unstructured":"Cole, R., Dodis, Y., Roughgarden, T.: Bottleneck Links, Variable Demand, and the Tragedy of the Commons. In: Proc.\u00a0of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2006), pp. 668\u2013677 (2006)","DOI":"10.1145\/1109557.1109630"},{"key":"30_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/978-3-540-25960-2_5","volume-title":"Integer Programming and Combinatorial Optimization","author":"J.R. Correa","year":"2004","unstructured":"Correa, J.R., Schulz, A.S., Stier-Moses, N.E.: Computational Complexity, Fairness, and the Price of Anarchy of the Maximum Latency Problem. In: Bienstock, D., Nemhauser, G.L. (eds.) IPCO 2004. LNCS, vol.\u00a03064, pp. 59\u201373. Springer, Heidelberg (2004); An extended version will appear in Operations Research"},{"key":"30_CR10","doi-asserted-by":"crossref","unstructured":"Czumaj, A., Krysta, P., V\u00f6cking, B.: Selfish Traffic Allocation for Server Farms. In: Proc.\u00a0of the 34th Annual ACM Symposium on Theory of Computing (STOC 2002), pp. 287\u2013296 (2002)","DOI":"10.1145\/509948.509952"},{"key":"30_CR11","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":"30_CR12","volume-title":"Queueing Systems, vol. 1: Theory","author":"L. Kleinrock","year":"1975","unstructured":"Kleinrock, L.: Queueing Systems, vol. 1: Theory. Wiley-Interscience, Chichester (1975)"},{"issue":"3","key":"30_CR13","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1109\/9.557575","volume":"42","author":"Y.A. Korilis","year":"1997","unstructured":"Korilis, Y.A., Lazar, A.A., Orda, A.: Capacity Allocation Under Noncooperative Routing. IEEE Transactions on Automatic Control\u00a042(3), 309\u2013325 (1997)","journal-title":"IEEE Transactions on Automatic Control"},{"key":"30_CR14","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":"2","key":"30_CR15","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BF01215349","volume":"14","author":"F.T. Leighton","year":"1994","unstructured":"Leighton, F.T., Maggs, B.M., Rao, S.B.: Packet Routing and Job-Scheduling in O(Congestion + Dilation) steps. Combinatroica\u00a014(2), 167\u2013186 (1994)","journal-title":"Combinatroica"},{"issue":"5","key":"30_CR16","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"},{"issue":"3","key":"30_CR17","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/BF01211424","volume":"2","author":"K.P. Rath","year":"1992","unstructured":"Rath, K.P.: A direct proof of the existence of pure strategy equilibria in games with a continuum of players. Economic Theory\u00a02(3), 427\u2013433 (1992)","journal-title":"Economic Theory"},{"key":"30_CR18","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1164-8","volume-title":"Computer Networks and Systems: Queuing Theory and Performance Evaluation","author":"T.G. Robertazzi","year":"2000","unstructured":"Robertazzi, T.G.: Computer Networks and Systems: Queuing Theory and Performance Evaluation. Springer, Heidelberg (2000)"},{"issue":"2","key":"30_CR19","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. Journal of Computer and System Sciences\u00a067(2), 341\u2013364 (2003)","journal-title":"Journal of Computer and System Sciences"},{"key":"30_CR20","unstructured":"Roughgarden, T.: The Maximum Latency of Selfish Routing. In: Proc.\u00a0of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2004), pp. 980\u2013981 (2004)"},{"key":"30_CR21","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":"30_CR22","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"},{"issue":"4","key":"30_CR23","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/BF01014905","volume":"7","author":"D. Schmeidler","year":"1973","unstructured":"Schmeidler, D.: Equilibrium points of nonatomic games. Journal of Statistical Physics\u00a07(4), 295\u2013300 (1973)","journal-title":"Journal of Statistical Physics"},{"key":"30_CR24","volume-title":"Telecommunication Networks: Protocols, Modeling and Analysis","author":"M. Schwarz","year":"1987","unstructured":"Schwarz, M.: Telecommunication Networks: Protocols, Modeling and Analysis. Addison-Wesley, Reading (1987)"},{"key":"30_CR25","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.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_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T13:09:38Z","timestamp":1558271378000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11944874_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540681380","9783540681410"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/11944874_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}