{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T03:11:46Z","timestamp":1775272306426,"version":"3.50.1"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030046507","type":"print"},{"value":"9783030046514","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-030-04651-4_39","type":"book-chapter","created":{"date-parts":[[2018,11,15]],"date-time":"2018-11-15T14:56:50Z","timestamp":1542293810000},"page":"577-591","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Rent Division Among Groups"],"prefix":"10.1007","author":[{"given":"Mohammad","family":"Ghodsi","sequence":"first","affiliation":[]},{"given":"Mohamad","family":"Latifian","sequence":"additional","affiliation":[]},{"given":"Arman","family":"Mohammadi","sequence":"additional","affiliation":[]},{"given":"Sadra","family":"Moradian","sequence":"additional","affiliation":[]},{"given":"Masoud","family":"Seddighin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,11,16]]},"reference":[{"key":"39_CR1","unstructured":"Foley, D.K.: Resource allocation and the public sector (1967)"},{"key":"39_CR2","volume-title":"Puzzle math","author":"G Gamov","year":"1958","unstructured":"Gamov, G., Stern, M.: Puzzle math. Viking, New York (1958)"},{"issue":"7","key":"39_CR3","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1145\/2483852.2483870","volume":"56","author":"AD Procaccia","year":"2013","unstructured":"Procaccia, A.D.: Cake cutting: not just child\u2019s play. Commun. ACM 56(7), 78\u201387 (2013)","journal-title":"Commun. ACM"},{"key":"39_CR4","doi-asserted-by":"crossref","unstructured":"Robertson, J., Webb, W.: Cake-Cutting Algorithms: Be Fair If You Can (1998)","DOI":"10.1201\/9781439863855"},{"key":"39_CR5","doi-asserted-by":"crossref","unstructured":"Segal-Halevi, E., Hassidim, A., Aumann, Y.: Envy-free cake-cutting in two dimensions. In: AAAI, vol. 15, pp. 1021\u20131028 (2015)","DOI":"10.1609\/aaai.v29i1.9309"},{"key":"39_CR6","doi-asserted-by":"crossref","unstructured":"Gal, Y.K., Mash, M., Procaccia, A.D., Zick, Y.: Which is the fairest (rent division) of them all? In: Proceedings of the 2016 ACM Conference on Economics and Computation, pp. 67\u201384. ACM (2016)","DOI":"10.1145\/2940716.2940724"},{"key":"39_CR7","doi-asserted-by":"crossref","unstructured":"Cohler, Y.J., Lai, J.K., Parkes, D.C., Procaccia, A.D.: Optimal envy-free cake cutting. In: AAAI (2011)","DOI":"10.1609\/aaai.v25i1.7874"},{"issue":"10","key":"39_CR8","doi-asserted-by":"publisher","first-page":"930","DOI":"10.2307\/2589747","volume":"106","author":"FE Su","year":"1999","unstructured":"Su, F.E.: Rental harmony: Sperner\u2019s lemma in fair division. Am. Math. Mon. 106(10), 930\u2013942 (1999)","journal-title":"Am. Math. Mon."},{"issue":"3","key":"39_CR9","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/BF00179981","volume":"12","author":"E Aragones","year":"1995","unstructured":"Aragones, E.: A derivation of the money Rawlsian solution. Soc. Choice Welf. 12(3), 267\u2013276 (1995)","journal-title":"Soc. Choice Welf."},{"key":"39_CR10","doi-asserted-by":"crossref","unstructured":"Chan, P.H., Huang, X., Liu, Z., Zhang, C., Zhang, S.: Assignment and pricing in roommate market. In: AAAI, pp. 446\u2013452 (2016)","DOI":"10.1609\/aaai.v30i1.10019"},{"key":"39_CR11","unstructured":"Segal-Halevi, E., Nitzan, S.: Proportional cake-cutting among families. arXiv preprint arXiv:1510.03903 (2015)"},{"issue":"2","key":"39_CR12","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1006\/obhd.1997.2738","volume":"72","author":"C Robert","year":"1997","unstructured":"Robert, C., Carnevale, P.J.: Group choice in ultimatum bargaining. Organ. Behav. Hum. Decis. Process. 72(2), 256\u2013279 (1997)","journal-title":"Organ. Behav. Hum. Decis. Process."},{"issue":"1","key":"39_CR13","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1023\/A:1009914001822","volume":"1","author":"G Bornstein","year":"1998","unstructured":"Bornstein, G., Yaniv, I.: Individual and group behavior in the ultimatum game: are groups more \u201crational\" players? Exp. Econ. 1(1), 101\u2013108 (1998)","journal-title":"Exp. Econ."},{"issue":"2","key":"39_CR14","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1006\/obhd.1997.2678","volume":"69","author":"DM Messick","year":"1997","unstructured":"Messick, D.M., Moore, D.A., Bazerman, M.H.: Ultimatum bargaining with a group: underestimating the importance of the decision rule. Organ. Behav. Hum. Decis. Process. 69(2), 87\u2013101 (1997)","journal-title":"Organ. Behav. Hum. Decis. Process."},{"key":"39_CR15","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.jtbi.2015.04.025","volume":"378","author":"FP Santos","year":"2015","unstructured":"Santos, F.P., Santos, F.C., Paiva, A., Pacheco, J.M.: Evolutionary dynamics of group fairness. J. Theor. Biol. 378, 96\u2013102 (2015)","journal-title":"J. Theor. Biol."},{"key":"39_CR16","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/j.mathsocsci.2017.05.006","volume":"89","author":"P Manurangsi","year":"2017","unstructured":"Manurangsi, P., Suksompong, W.: Asymptotic existence of fair divisions for groups. Math. Soc. Sci. 89, 100\u2013108 (2017)","journal-title":"Math. Soc. Sci."},{"key":"39_CR17","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/j.mathsocsci.2017.09.004","volume":"92","author":"W Suksompong","year":"2018","unstructured":"Suksompong, W.: Approximate maximin shares for groups of agents. Math. Soc. Sci. 92, 40\u201347 (2018)","journal-title":"Math. Soc. Sci."},{"issue":"1","key":"39_CR18","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1016\/j.geb.2012.10.009","volume":"77","author":"Y Chen","year":"2013","unstructured":"Chen, Y., Lai, J.K., Parkes, D.C., Procaccia, A.D.: Truth, justice, and cake cutting. Games Econ. Behav. 77(1), 284\u2013297 (2013)","journal-title":"Games Econ. Behav."},{"key":"39_CR19","doi-asserted-by":"crossref","unstructured":"Alijani, R., Farhadi, M., Ghodsi, M., Seddighin, M., Tajik, A.S.: Envy-free mechanisms with minimum number of cuts. In: AAAI, pp. 312\u2013318 (2017)","DOI":"10.1609\/aaai.v31i1.10584"},{"issue":"1","key":"39_CR20","doi-asserted-by":"crossref","first-page":"11","DOI":"10.37236\/735","volume":"15","author":"W Stromquist","year":"2008","unstructured":"Stromquist, W.: Envy-free cake divisions cannot be found by finite protocols. Electron. J. Comb. 15(1), 11 (2008)","journal-title":"Electron. J. Comb."},{"key":"39_CR21","doi-asserted-by":"publisher","first-page":"2564","DOI":"10.1137\/1.9781611975031.164","volume-title":"Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Sina Dehghani","year":"2018","unstructured":"Dehghani, S., Farhadi, A., HajiAghayi, M., Yami, H.: Envy-free chore division for an arbitrary number of agents. In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 2564\u20132583. SIAM (2018)"},{"issue":"4","key":"39_CR22","doi-asserted-by":"publisher","first-page":"1023","DOI":"10.2307\/2938172","volume":"59","author":"Ahmet Alkan","year":"1991","unstructured":"Alkan, A., Demange, G., Gale, D.: Fair allocation of indivisible goods and criteria of justice. Econ.: J. Econ. Soc. 1023\u20131039 (1991)","journal-title":"Econometrica"},{"key":"39_CR23","doi-asserted-by":"crossref","unstructured":"Ghodsi, M., HajiAghayi, M., Seddighin, M., Seddighin, S., Yami, H.: Fair allocation of indivisible goods: improvements and generalizations. In: Proceedings of the 2018 ACM Conference on Economics and Computation, pp. 539\u2013556. ACM (2018)","DOI":"10.1145\/3219166.3219238"},{"key":"39_CR24","doi-asserted-by":"crossref","unstructured":"Farhadi, A., et al.: Fair allocation of indivisible goods to asymmetric agents. In: Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, pp. 1535\u20131537. International Foundation for Autonomous Agents and Multiagent Systems (2017)","DOI":"10.65109\/HGKV7584"},{"key":"39_CR25","doi-asserted-by":"crossref","unstructured":"Procaccia, A.D., Wang, J.: Fair enough: guaranteeing approximate maximin shares. In: Proceedings of the Fifteenth ACM Conference on Economics and Computation, pp. 675\u2013692. ACM (2014)","DOI":"10.1145\/2600057.2602835"},{"issue":"4","key":"39_CR26","first-page":"52","volume":"13","author":"G Amanatidis","year":"2017","unstructured":"Amanatidis, G., Markakis, E., Nikzad, A., Saberi, A.: Approximation algorithms for computing maximin share allocations. ACM Trans. Algorithms (TALG) 13(4), 52 (2017)","journal-title":"ACM Trans. Algorithms (TALG)"},{"issue":"1","key":"39_CR27","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1145\/2845926.2845931","volume":"14","author":"Richard Cole","year":"2015","unstructured":"Cole, R., Gkatzelis, V.: Approximating the nash social welfare with indivisible items. In: Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, pp. 371\u2013380. ACM (2015)","journal-title":"ACM SIGecom Exchanges"},{"key":"39_CR28","doi-asserted-by":"crossref","unstructured":"Ghodsi, M., Saleh, H., Seddighin, M.: Fair allocation of indivisible items with externalities. arXiv preprint arXiv:1805.06191 (2018)","DOI":"10.1145\/3219166.3219238"},{"key":"39_CR29","doi-asserted-by":"crossref","unstructured":"Procaccia, A.D., Velez, R.A., Yu, D.: Fair rent division on a budget. In: AAAI (2018)","DOI":"10.1609\/aaai.v32i1.11465"},{"key":"39_CR30","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1016\/j.jet.2014.06.006","volume":"153","author":"Y Azrieli","year":"2014","unstructured":"Azrieli, Y., Shmaya, E.: Rental harmony with roommates. J. Econ. Theory 153, 128\u2013137 (2014)","journal-title":"J. Econ. Theory"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-04651-4_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T02:32:06Z","timestamp":1775269926000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-04651-4_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030046507","9783030046514"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-04651-4_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"16 November 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Atlanta, GA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/spacl.kennesaw.edu\/cocoa2018\/cfp.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}