{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T03:39:53Z","timestamp":1775705993249,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540228493","type":"print"},{"value":"9783540278368","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27836-8_31","type":"book-chapter","created":{"date-parts":[[2010,9,15]],"date-time":"2010-09-15T18:53:21Z","timestamp":1284576801000},"page":"345-357","source":"Crossref","is-referenced-by-count":84,"title":["Coordination Mechanisms"],"prefix":"10.1007","author":[{"given":"George","family":"Christodoulou","sequence":"first","affiliation":[]},{"given":"Elias","family":"Koutsoupias","sequence":"additional","affiliation":[]},{"given":"Akash","family":"Nanavati","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"31_CR1","unstructured":"Archer, A., Tardos, E.: Frugal Path Mechanisms. In: ACM-SIAM SODA (2002)"},{"key":"31_CR2","doi-asserted-by":"crossref","unstructured":"Cole, R., Dodis, Y., Roughgarden, T.: How much can taxes help selfish routing. In: ACM EC, pp. 98\u2013107 (2003)","DOI":"10.1145\/779928.779941"},{"key":"31_CR3","doi-asserted-by":"crossref","unstructured":"Cole, R., Dodis, Y., Roughgarden, T.: Pricing network edges for heterogeneous selfish users. In: ACM STOC, pp. 521\u2013530 (2003)","DOI":"10.1145\/780542.780618"},{"issue":"1","key":"31_CR4","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1137\/0209007","volume":"9","author":"Y. Cho","year":"1980","unstructured":"Cho, Y., Sahni, S.: Bounds for list schedules on uniform processors. SIAM J. Comput.\u00a09(1), 91\u2013103 (1980)","journal-title":"SIAM J. Comput."},{"key":"31_CR5","unstructured":"Czumaj, A., V\u00f6cking, B.: Tight Bounds for Worst-case Equilibria. In: ACM-SIAM SODA, pp. 413\u2013420 (2002)"},{"key":"31_CR6","unstructured":"Fabrikant, A., Papadimitriou, C., Tulwar, K.: On the complexity of pure equilibria, www.cs.berkeley.edu\/~christos\/papers\/pure.ps"},{"issue":"1","key":"31_CR7","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1137\/0206013","volume":"6","author":"T. Gonzalez","year":"1977","unstructured":"Gonzalez, T., Ibarra, O., Sahni, S.: Bounds for LPT schedules on uniform processors. SIAM J. Comput.\u00a06(1), 155\u2013166 (1977)","journal-title":"SIAM J. Comput."},{"key":"31_CR8","doi-asserted-by":"crossref","first-page":"1563","DOI":"10.1002\/j.1538-7305.1966.tb01709.x","volume":"45","author":"R.L. Graham","year":"1966","unstructured":"Graham, R.L.: Bounds for certain multiprocessing anomalies. Bell System Technical Journal\u00a045, 1563\u20131581 (1966)","journal-title":"Bell System Technical Journal"},{"issue":"7","key":"31_CR9","doi-asserted-by":"publisher","first-page":"1241","DOI":"10.1109\/49.414643","volume":"13","author":"Y. Korilis","year":"1995","unstructured":"Korilis, Y., Lazar, A., Orda, A.: Architecting Noncooperative Networks. IEEE Journal on Selected Areas in Communications\u00a013(7), 1241\u20131251 (1995)","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"31_CR10","unstructured":"Koutsoupias, E., Mavronicolas, M., Spirakis, P.: Approximate Equilibria and Ball Fusion. In: Proceedings of the 9th International Colloquium on Structural Information and Communication Complexity, SIROCCO (2002)"},{"key":"31_CR11","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)"},{"key":"31_CR12","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, 111\u2013124 (1996)","journal-title":"Games and Economic Behavior"},{"key":"31_CR13","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 and Economic Behavior\u00a014, 124\u2013143 (1996)","journal-title":"Games and and Economic Behavior"},{"key":"31_CR14","doi-asserted-by":"crossref","unstructured":"Monderer, D., Tennenholtz, M.: k-Implementation. In: ACM EC, pp. 19\u201328 (2003)","DOI":"10.1145\/779928.779931"},{"key":"31_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-49116-3_1","volume-title":"STACS 99","author":"N. Nisan","year":"1999","unstructured":"Nisan, N.: Algorithms for selfish agents: Mechanism design for distributed computation. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol.\u00a01563, pp. 1\u201315. Springer, Heidelberg (1999)"},{"key":"31_CR16","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1006\/game.1999.0790","volume":"35","author":"N. Nisan","year":"2001","unstructured":"Nisan, N., Ronen, A.: Algorithmic mechanism design. Games and Economic Behavior\u00a035, 166\u2013196 (2001)","journal-title":"Games and Economic Behavior"},{"key":"31_CR17","volume-title":"A Course in Game Theory","author":"M.J. Osborne","year":"1994","unstructured":"Osborne, M.J., Rubinstein, A.: A Course in Game Theory. The MIT Press, Cambridge (1994)"},{"key":"31_CR18","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.H.: Algorithms, games, and the Internet. In: ACM STOC, pp. 749\u2013753 (2001)","DOI":"10.1145\/380752.380883"},{"key":"31_CR19","doi-asserted-by":"crossref","unstructured":"Ronen, A.: Algorithms for rational agents. In: Conference on Current Trends in Theory and Practice of Informatics, pp. 56\u201370 (2000)","DOI":"10.1007\/3-540-44411-4_5"},{"key":"31_CR20","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":"31_CR21","doi-asserted-by":"crossref","unstructured":"Roughgarden, T.: Designing networks for selfish users is hard. In: IEEE FOCS, pp. 472\u2013481 (2001)","DOI":"10.1109\/SFCS.2001.959923"},{"key":"31_CR22","doi-asserted-by":"crossref","unstructured":"Roughgarden, T.: The price of anarchy is independent of the network topology. In: ACM STOC, pp. 428-437 (2002)","DOI":"10.1145\/509907.509971"},{"issue":"2","key":"31_CR23","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1145\/506147.506153","volume":"49","author":"T. Roughgarden","year":"2002","unstructured":"Roughgarden, T., Tardos, E.: How bad is selfish routing? Journal of the ACM\u00a049(2), 236\u2013259 (2002)","journal-title":"Journal of the ACM"},{"key":"31_CR24","doi-asserted-by":"crossref","unstructured":"Wardrop, J.G.: Some theoretical aspects of road traffic research. In: Proceedings of the Institute of Civil Engineers, Pt. II, vol. 1, 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\/978-3-540-27836-8_31.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T23:23:54Z","timestamp":1605741834000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27836-8_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540228493","9783540278368"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27836-8_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}