{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:43:44Z","timestamp":1767339824617,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030174019"},{"type":"electronic","value":"9783030174026"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-17402-6_7","type":"book-chapter","created":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T13:37:00Z","timestamp":1558359420000},"page":"75-86","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Project Games"],"prefix":"10.1007","author":[{"given":"Vittorio","family":"Bil\u00f2","sequence":"first","affiliation":[]},{"given":"Laurent","family":"Gourv\u00e8s","sequence":"additional","affiliation":[]},{"given":"J\u00e9r\u00f4me","family":"Monnot","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,4,6]]},"reference":[{"key":"7_CR1","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 1999","author":"E Koutsoupias","year":"1999","unstructured":"Koutsoupias, E., Papadimitriou, C.H.: Worst-case equilibria. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol. 1563, pp. 404\u2013413. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-49116-3_38"},{"key":"7_CR2","unstructured":"Anshelevich, E., Dasgupta, A., Kleinberg, J.M., Tardos, \u00c9., Wexler, T., Roughgarden, T.: The price of stability for network design with fair cost allocation. In: Proceedings of the 45th Symposium on Foundations of Computer Science (FOCS), pp. 295\u2013304 (2004)"},{"key":"7_CR3","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1016\/j.geb.2003.12.004","volume":"49","author":"S Morris","year":"2004","unstructured":"Morris, S., Ui, T.: Best response equivalence. Games Econ. Behav. 49, 260\u2013287 (2004)","journal-title":"Games Econ. Behav."},{"key":"7_CR4","unstructured":"Vetta, A.: Nash equilibria in competitive societies, with applications to facility location, traffic routing and auctions. In: Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS), pp. 416\u2013425 (2002)"},{"key":"7_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/15427951.2013.830164","volume":"11","author":"J Augustine","year":"2015","unstructured":"Augustine, J., Chen, N., Elkind, E., Fanelli, A., Gravin, N., Shiryaev, D.: Dynamics of profit-sharing games. Internet Math. 11, 1\u201322 (2015)","journal-title":"Internet Math."},{"key":"7_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/978-3-642-45046-4_4","volume-title":"Web and Internet Economics","author":"Y Bachrach","year":"2013","unstructured":"Bachrach, Y., Syrgkanis, V., Vojnovi\u0107, M.: Incentives and efficiency in uncertain collaborative environments. In: Chen, Y., Immorlica, N. (eds.) WINE 2013. LNCS, vol. 8289, pp. 26\u201339. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-45046-4_4"},{"key":"7_CR7","unstructured":"Gollapudi, S., Kollias, K., Panigrahi, D., Pliatsika, V.: Profit sharing and efficiency in utility games. In: Proceedings of the 25th Annual European Symposium on Algorithms (ESA), pp. 43:1\u201343:14 (2017)"},{"key":"7_CR8","doi-asserted-by":"publisher","first-page":"1020","DOI":"10.1109\/JSAC.2006.872884","volume":"24","author":"MX Goemans","year":"2006","unstructured":"Goemans, M.X., Li, L., Mirrokni, V.S., Thottan, M.: Market sharing games applied to content distribution in ad hoc networks. IEEE J. Sel. Areas Commun. 24, 1020\u20131033 (2006)","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Kleinberg, J.M., Oren, S.: Mechanisms for (mis)allocating scientific credit. In: Proceedings of the 43rd ACM Symposium on Theory of Computing (STOC), pp. 529\u2013538 (2011)","DOI":"10.1145\/1993636.1993707"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Marden, J.R., Roughgarden, T.: Generalized efficiency bounds in distributed resource allocation. In: Proceedings of the 49th IEEE Conference on Decision and Control (CDC), pp. 2233\u20132238 (2010)","DOI":"10.1109\/CDC.2010.5717472"},{"key":"7_CR11","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1287\/opre.1120.1137","volume":"61","author":"JR Marden","year":"2013","unstructured":"Marden, J.R., Wierman, A.: Distributed welfare games. Oper. Res. 61, 155\u2013168 (2013)","journal-title":"Oper. Res."},{"key":"7_CR12","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. Int. J. Game Theory 2, 65\u201367 (1973)","journal-title":"Int. J. Game Theory"},{"key":"7_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 Econ. Behav. 14, 124\u2013143 (1996)","journal-title":"Games Econ. Behav."},{"key":"7_CR14","unstructured":"Ieong, S., McGrew, R., Nudelman, E., Shoham, Y., Sun, Q.: Fast and compact: a simple class of congestion games. In: Proceedings of the 20th National Conference on Artificial Intelligence (AAAI), pp. 489\u2013494 (2005)"},{"key":"7_CR15","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 Econ. Behav. 13, 111\u2013124 (1996)","journal-title":"Games Econ. Behav."},{"key":"7_CR16","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1017\/CBO9780511800481.022","volume-title":"Algorithmic Game Theory","author":"B V\u00f6cking","year":"2007","unstructured":"V\u00f6cking, B.: Selfish load balancing. In: Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V.V. (eds.) Algorithmic Game Theory, pp. 517\u2013542. Cambridge University Press, New York (2007)"},{"key":"7_CR17","doi-asserted-by":"publisher","first-page":"987","DOI":"10.2307\/1912943","volume":"48","author":"JH Dr\u00e8ze","year":"1980","unstructured":"Dr\u00e8ze, J.H., Greenberg, J.: Hedonic coalitions: optimality and stability. Econometrica 48, 987\u20131003 (1980)","journal-title":"Econometrica"},{"key":"7_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/978-3-642-35311-6_12","volume-title":"Internet and Network Economics","author":"A Darmann","year":"2012","unstructured":"Darmann, A., Elkind, E., Kurz, S., Lang, J., Schauer, J., Woeginger, G.: Group activity selection problem. In: Goldberg, P.W. (ed.) WINE 2012. LNCS, vol. 7695, pp. 156\u2013169. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-35311-6_12"},{"key":"7_CR19","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., Eidenbenz, S., Triguero, F., Morales, R., Conejo, R., Hennessy, M. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 123\u2013134. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45465-9_12"},{"key":"7_CR20","doi-asserted-by":"crossref","unstructured":"Gairing, M., Lucking, T., Mavronicolas, M., Monien, B.: Computing Nash equilibria for scheduling on restricted parallel links. In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC), pp. 613\u2013622 (2004)","DOI":"10.1145\/1007352.1007446"},{"key":"7_CR21","doi-asserted-by":"crossref","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 (STOC), pp. 604\u2013612 (2004)","DOI":"10.1145\/1007352.1007445"},{"key":"7_CR22","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. 4051, pp. 501\u2013512. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11786986_44"},{"key":"7_CR23","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1142\/S0129626409000122","volume":"19","author":"C Georgiou","year":"2009","unstructured":"Georgiou, C., Pavlides, T., Philippou, A.: Selfish routing in the presence of network uncertainty. Parallel Process. Lett. 19, 141\u2013157 (2009)","journal-title":"Parallel Process. Lett."},{"key":"7_CR24","doi-asserted-by":"publisher","first-page":"1288","DOI":"10.1007\/s00224-017-9826-1","volume":"62","author":"V Bil\u00f3","year":"2018","unstructured":"Bil\u00f3, V.: A unifying tool for bounding the quality of non-cooperative solutions in weighted congestion games. Theory Comput. Syst. 62, 1288\u20131317 (2018)","journal-title":"Theory Comput. Syst."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-17402-6_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T16:27:49Z","timestamp":1710347269000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-17402-6_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030174019","9783030174026"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-17402-6_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"6 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rome","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 May 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 May 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ciac2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/easyconferences.eu\/ciac2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"95","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"14","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}