{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:30:12Z","timestamp":1725535812040},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642020285"},{"type":"electronic","value":"9783642020292"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02029-2_5","type":"book-chapter","created":{"date-parts":[[2009,7,27]],"date-time":"2009-07-27T14:12:39Z","timestamp":1248703959000},"page":"41-53","source":"Crossref","is-referenced-by-count":2,"title":["Asynchronous Congestion Games"],"prefix":"10.1007","author":[{"given":"Michal","family":"Penn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maria","family":"Polukarov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moshe","family":"Tennenholtz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","unstructured":"Penn, M., Polukarov, M., Tennenholtz, M.: Asynchronous congestion games. In: Proc. of 7th Int. Conf. on Autonomous Agents and Multiagent Systems (AAMAS 2008), pp. 1605\u20131608 (May 2008)"},{"key":"5_CR2","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 and Computing (STOC 2005), pp. 67\u201373 (2005)","DOI":"10.1145\/1060590.1060600"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Fabrikant, A., Papadimitriou, C., Talwar, K.: The complexity of pure Nash equilibria. In: STOC 2004, pp. 604\u2013612 (2004)","DOI":"10.1145\/1007352.1007445"},{"key":"5_CR4","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":"5_CR5","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/4-431-30899-7_16","volume":"8","author":"D. Monderer","year":"2006","unstructured":"Monderer, D.: Solution-based congestion games. Advances in Mathematical Economics\u00a08, 397\u2013407 (2006)","journal-title":"Advances in Mathematical Economics"},{"key":"5_CR6","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.: Potential games. Games and Economic Behavior\u00a014, 124\u2013143 (1996)","journal-title":"Games and Economic Behavior"},{"key":"5_CR7","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF01737559","volume":"2","author":"R. Rosenthal","year":"1973","unstructured":"Rosenthal, R.: 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":"5_CR8","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1006\/game.1998.0689","volume":"28","author":"D. Monderer","year":"1999","unstructured":"Monderer, D., Tennenholtz, M.: Distributed games. Games and Economic Behavior\u00a028, 181\u2013188 (1999)","journal-title":"Games and Economic Behavior"},{"key":"5_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1007\/978-3-540-24749-4_53","volume-title":"STACS 2004","author":"V. Auletta","year":"2004","unstructured":"Auletta, V., Prisco, R., Penna, P., Persiano, G.: Determinisitc truthful approximation mechanisms for scheduling related machines. In: Diekert, V., Habib, M. (eds.) STACS 2004. LNCS, vol.\u00a02996, pp. 608\u2013619. Springer, Heidelberg (2004)"},{"key":"5_CR10","first-page":"83","volume-title":"ISPDC 2005","author":"D. Grosu","year":"2005","unstructured":"Grosu, D., Carroll, T.: A strategyproof mechanism for scheduling divisible loads in distributed systems. In: ISPDC 2005, pp. 83\u201390. IEEE Computer Society, Los Alamitos (2005)"},{"issue":"1\/2","key":"5_CR11","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(1\/2), 166\u2013196 (2001)","journal-title":"Games and Economic Behavior"},{"key":"5_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"698","DOI":"10.1007\/11600930_70","volume-title":"Internet and Network Economics","author":"E. Angel","year":"2005","unstructured":"Angel, E., Bampis, E., Pascual, F.: Truthful algorithms for scheduling selfish tasks on parallel machines. In: Deng, X., Ye, Y. (eds.) WINE 2005. LNCS, vol.\u00a03828, pp. 698\u2013707. Springer, Heidelberg (2005)"},{"key":"5_CR13","first-page":"99","volume-title":"ISPDC 2006","author":"T. Carroll","year":"2006","unstructured":"Carroll, T., Grosu, D.: Selfish multi-user task scheduling. In: ISPDC 2006, pp. 99\u2013106. IEEE Computer Society, Los Alamitos (2006)"},{"key":"5_CR14","first-page":"79","volume":"81","author":"E. Koutsoupias","year":"2003","unstructured":"Koutsoupias, E.: Selfish task allocation. Bulletin of EATCS\u00a081, 79\u201388 (2003)","journal-title":"Bulletin of EATCS"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Penn, M., Polukarov, M., Tennenholtz, M.: Congestion games with load-dependent failures: identical resources. In: Proceedings of the 8th ACM Conference on Electronic Commerce (EC 2007), pp. 210\u2013217 (2007)","DOI":"10.1145\/1250910.1250941"}],"container-title":["Lecture Notes in Computer Science","Graph Theory, Computational Intelligence and Thought"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02029-2_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T07:15:12Z","timestamp":1552115712000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02029-2_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642020285","9783642020292"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02029-2_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}