{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T23:00:48Z","timestamp":1762297248225},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540744559"},{"type":"electronic","value":"9783540744566"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74456-6_56","type":"book-chapter","created":{"date-parts":[[2007,8,14]],"date-time":"2007-08-14T07:29:48Z","timestamp":1187076588000},"page":"633-644","source":"Crossref","is-referenced-by-count":37,"title":["Congestion Games with Player-Specific Constants"],"prefix":"10.1007","author":[{"given":"Marios","family":"Mavronicolas","sequence":"first","affiliation":[]},{"given":"Igal","family":"Milchtaich","sequence":"additional","affiliation":[]},{"given":"Burkhard","family":"Monien","sequence":"additional","affiliation":[]},{"given":"Karsten","family":"Tiemann","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"56_CR1","first-page":"613","volume-title":"Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science","author":"H. Ackermann","year":"2006","unstructured":"Ackermann, H., R\u00f6glin, H., V\u00f6cking, B.: On the Impact of Combinatorial Structure on Congestion Games. In: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, pp. 613\u2013622. IEEE Computer Society Press, Los Alamitos (2006)"},{"key":"56_CR2","series-title":"Lecture Notes in Computer Science","first-page":"50","volume-title":"Proceedings of the 2nd International Workshop on Internet and Network Economics","author":"J. Dunkel","year":"2006","unstructured":"Dunkel, J., Schulz, A.: On the Complexity of Pure-Strategy Nash Equilibria in Congestion and Local-Effect Games. In: Spirakis, P.G., Mavronicolas, M., Kontogiannis, S.C. (eds.) WINE 2006. LNCS, vol.\u00a04286, pp. 50\u201361. Springer, Heidelberg (2006)"},{"key":"56_CR3","first-page":"604","volume-title":"Proceedings of the 36th Annual ACM Symposium on Theory of Computing","author":"A. Fabrikant","year":"2004","unstructured":"Fabrikant, A., Papadimitriou, C.H., Talwar, K.: The Complexity of Pure Nash Equilibria. In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing, pp. 604\u2013612. ACM Press, New York (2004)"},{"key":"56_CR4","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1023\/A:1004991825894","volume":"42","author":"G. Facchini","year":"1997","unstructured":"Facchini, G., van Megan, F., Borm, P., Tijs, S.: Congestion Models and Weighted Bayesian Potential Games. Theory and Decision\u00a042, 193\u2013206 (1997)","journal-title":"Theory and Decision"},{"key":"56_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/3-540-45465-9_12","volume-title":"Automata, Languages and Programming","author":"D. Fotakis","year":"2002","unstructured":"Fotakis, D., Kontogiannis, S., Koutsoupias, E., Mavronicolas, M., Spirakis, P.: The Structure and Complexity of Nash Equilibria for a Selfish Routing Game. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol.\u00a02380, pp. 123\u2013134. Springer, Heidelberg (2002)"},{"issue":"2-3","key":"56_CR6","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1016\/j.tcs.2005.09.024","volume":"348","author":"D. Fotakis","year":"2005","unstructured":"Fotakis, D., Kontogiannis, S., Spirakis, P.: Selfish Unsplittable Flows. Theoretical Computer Science\u00a0348(2-3), 226\u2013239 (2005)","journal-title":"Theoretical Computer Science"},{"key":"56_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/11786986_44","volume-title":"Automata, Languages and Programming","author":"M. Gairing","year":"2006","unstructured":"Gairing, M., Monien, B., Tiemann, K.: Routing (Un-)Splittable Flow in Games with Player-Specific Linear Latency Functions. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04051, pp. 501\u2013512. Springer, Heidelberg (2006)"},{"key":"56_CR8","first-page":"105","volume-title":"CD-ROM Proceedings of the 20th IEEE International Parallel & Distributed Processing Symposium","author":"C. Georgiou","year":"2006","unstructured":"Georgiou, C., Pavlides, T., Philippou, A.: Network Uncertainty in Selfish Routing. In: CD-ROM Proceedings of the 20th IEEE International Parallel & Distributed Processing Symposium, p. 105. IEEE Computer Society Press, Los Alamitos (2006)"},{"key":"56_CR9","unstructured":"Goodearl, K.R.: Partially Ordered Abelian Groups with Interpolation. American Mathematical Society (1986)"},{"issue":"2","key":"56_CR10","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1137\/0117039","volume":"17","author":"R.L. Graham","year":"1969","unstructured":"Graham, R.L.: Bounds on Multiprocessing Timing Anomalies. SIAM Journal of Applied Mathematics\u00a017(2), 416\u2013429 (1969)","journal-title":"SIAM Journal of Applied Mathematics"},{"issue":"1","key":"56_CR11","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0022-0000(88)90046-3","volume":"37","author":"D.S. Johnson","year":"1988","unstructured":"Johnson, D.S., Papadimitriou, C.H., Yannakakis, M.: How Easy is Local Search? Journal of Computer and System Sciences\u00a037(1), 79\u2013100 (1988)","journal-title":"Journal of Computer and System Sciences"},{"issue":"4","key":"56_CR12","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":"56_CR13","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"},{"issue":"1","key":"56_CR14","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 and Economic Behavior\u00a014(1), 124\u2013143 (1996)","journal-title":"Games and Economic Behavior"},{"key":"56_CR15","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"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74456-6_56.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:29:26Z","timestamp":1619519366000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74456-6_56"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540744559","9783540744566"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74456-6_56","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}