{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T05:35:13Z","timestamp":1777613713979,"version":"3.51.4"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319666990","type":"print"},{"value":"9783319667003","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-66700-3_24","type":"book-chapter","created":{"date-parts":[[2017,8,18]],"date-time":"2017-08-18T12:38:47Z","timestamp":1503059927000},"page":"307-319","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["On Proportional Allocation in Hedonic Games"],"prefix":"10.1007","author":[{"given":"Martin","family":"Hoefer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wanchote","family":"Jiamjitrak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,8,19]]},"reference":[{"key":"24_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/978-3-642-40450-4_5","volume-title":"Algorithms \u2013 ESA 2013","author":"E Anshelevich","year":"2013","unstructured":"Anshelevich, E., Bhardwaj, O., Hoefer, M.: Friendship and stable matching. In: Bodlaender, H.L., Italiano, G.F. (eds.) ESA 2013. LNCS, vol. 8125, pp. 49\u201360. Springer, Heidelberg (2013). doi:10.1007\/978-3-642-40450-4_5"},{"issue":"1\u20132","key":"24_CR2","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/s00453-011-9520-7","volume":"63","author":"E Anshelevich","year":"2012","unstructured":"Anshelevich, E., Hoefer, M.: Contribution games in networks. Algorithmica 63(1\u20132), 51\u201390 (2012)","journal-title":"Algorithmica"},{"key":"24_CR3","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1016\/j.artint.2012.09.006","volume":"195","author":"H Aziz","year":"2013","unstructured":"Aziz, H., Brandt, F., Seedig, H.G.: Computing desirable partitions in additively separable hedonic games. Artif. Intell. 195, 316\u2013334 (2013)","journal-title":"Artif. Intell."},{"key":"24_CR4","doi-asserted-by":"crossref","unstructured":"Birnbaum, B., Devanur, N., Xiao, L.: Distributed algorithms via gradient descent for fisher markets. In: Proceedings of 12th Conference Electronic Commerce (EC), pp. 127\u2013136 (2011)","DOI":"10.1145\/1993574.1993594"},{"key":"24_CR5","unstructured":"Branzei, S., Larson, K.: Coalitional affinity games and the stability gap. In: Proceedings of 21st International Joint Conference on Artificial Intelligence (IJCAI), pp. 79\u201384 (2009)"},{"issue":"4","key":"24_CR6","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1007\/s00224-016-9674-4","volume":"59","author":"I Caragiannis","year":"2016","unstructured":"Caragiannis, I., Voudouris, A.: Welfare guarantees for proportional allocations. Theory Comput. Syst. 59(4), 581\u2013599 (2016)","journal-title":"Theory Comput. Syst."},{"key":"24_CR7","first-page":"1","volume-title":"Encyclopedia of Algorithms","author":"K Cechl\u00e1rova","year":"2008","unstructured":"Cechl\u00e1rova, K.: Stable partition problem. In: Kao, M.-Y. (ed.) Encyclopedia of Algorithms, pp. 1\u201399. Springer, New York (2008)"},{"issue":"4","key":"24_CR8","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1007\/s00224-016-9701-5","volume":"59","author":"G Christodoulou","year":"2016","unstructured":"Christodoulou, G., Sgouritsa, A., Tang, B.: On the efficiency of the proportional allocation mechanism for divisible resources. Theory Comput. Syst. 59(4), 600\u2013618 (2016)","journal-title":"Theory Comput. Syst."},{"issue":"3","key":"24_CR9","doi-asserted-by":"publisher","first-page":"751","DOI":"10.1287\/moor.24.3.751","volume":"24","author":"X Deng","year":"1999","unstructured":"Deng, X., Ibaraki, T., Nagamochi, H.: Algorithmic aspects of the core of combinatorial optimization games. Math. Oper. Res. 24(3), 751\u2013766 (1999)","journal-title":"Math. Oper. Res."},{"issue":"4","key":"24_CR10","doi-asserted-by":"publisher","first-page":"987","DOI":"10.2307\/1912943","volume":"48","author":"J Dreze","year":"1980","unstructured":"Dreze, J., Greenberg, J.: Hedonic coalitions: optimality and stability. Econometrica 48(4), 987\u20131003 (1980)","journal-title":"Econometrica"},{"key":"24_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/978-3-642-16170-4_16","volume-title":"Algorithmic Game Theory","author":"M Gairing","year":"2010","unstructured":"Gairing, M., Savani, R.: Computing stable outcomes in hedonic games. In: Kontogiannis, S., Koutsoupias, E., Spirakis, P.G. (eds.) SAGT 2010. LNCS, vol. 6386, pp. 174\u2013185. Springer, Heidelberg (2010). doi:10.1007\/978-3-642-16170-4_16"},{"issue":"4","key":"24_CR12","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1142\/S0219198906001144","volume":"8","author":"J Hajdukov\u00e1","year":"2006","unstructured":"Hajdukov\u00e1, J.: Coalition formation games: a survey. Int. Game Theory Rev. 8(4), 613\u2013641 (2006)","journal-title":"Int. Game Theory Rev."},{"issue":"1","key":"24_CR13","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/BF02392825","volume":"182","author":"J H\u00e5stad","year":"1999","unstructured":"H\u00e5stad, J.: Clique is hard to approximate within $$n^{1-\\varepsilon }$$. Acta Math. 182(1), 105\u2013142 (1999)","journal-title":"Acta Math."},{"key":"24_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/978-3-642-45046-4_21","volume-title":"Web and Internet Economics","author":"M Hoefer","year":"2013","unstructured":"Hoefer, M., Wagner, L.: Designing profit shares in matching and coalition formation games. In: Chen, Y., Immorlica, N. (eds.) WINE 2013. LNCS, vol. 8289, pp. 249\u2013262. Springer, Heidelberg (2013). doi:10.1007\/978-3-642-45046-4_21"},{"issue":"3","key":"24_CR15","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1287\/moor.1040.0091","volume":"29","author":"R Johari","year":"2004","unstructured":"Johari, R., Tsitsiklis, J.: Efficiency loss in a resource allocation game. Math. Oper. Res. 29(3), 407\u2013435 (2004)","journal-title":"Math. Oper. Res."},{"key":"24_CR16","doi-asserted-by":"crossref","unstructured":"Kleinberg, J., Oren, S.: Mechanisms for (mis)allocating scientific credit. In: Proceedings of 43rd Symposium on Theory of Computing (STOC), pp. 529\u2013538 (2011)","DOI":"10.1145\/1993636.1993707"},{"key":"24_CR17","doi-asserted-by":"crossref","unstructured":"Peters, D.: Graphical hedonic games of bounded treewidth. In: Proceedings of 23rd Conference on Artificial Intelligence (AAAI), pp. 586\u2013593 (2016)","DOI":"10.1609\/aaai.v30i1.10046"},{"key":"24_CR18","doi-asserted-by":"crossref","unstructured":"Peters, D.: Towards structural tractability in hedonic games. In: Proceedings of 23rd Conference on Artificial Intelligence (AAAI), pp. 4252\u20134253 (2016)","DOI":"10.1609\/aaai.v30i1.9935"},{"key":"24_CR19","unstructured":"Peters, D., Elkind, E.: Simple causes of complexity in hedonic games. In Proceedings of 24th International Joint Conference on Artificial Intelligence (IJCAI), pp. 617\u2013623 (2015)"},{"issue":"1","key":"24_CR20","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/0304-4068(74)90033-0","volume":"1","author":"L Shapley","year":"1974","unstructured":"Shapley, L., Scarf, H.: On cores and indivisibility. J. Math. Econ. 1(1), 23\u201337 (1974)","journal-title":"J. Math. Econ."},{"issue":"3","key":"24_CR21","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1016\/j.ejor.2009.09.004","volume":"203","author":"S-C Sung","year":"2010","unstructured":"Sung, S.-C., Dimitrov, D.: Computational complexity in additive hedonic games. Eur. J. Oper. Res. 203(3), 635\u2013639 (2010)","journal-title":"Eur. J. Oper. Res."},{"issue":"24","key":"24_CR22","doi-asserted-by":"publisher","first-page":"2691","DOI":"10.1016\/j.tcs.2010.06.021","volume":"412","author":"L Zhang","year":"2011","unstructured":"Zhang, L.: Proportional response dynamics in the fisher market. Theor. Comput. Sci. 412(24), 2691\u20132698 (2011)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-66700-3_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T16:27:53Z","timestamp":1709828873000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-66700-3_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319666990","9783319667003"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-66700-3_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"19 August 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAGT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Algorithmic Game Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"L'Aquila","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":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 September 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sagt2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cs.gssi.infn.it\/sagt2017","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}