{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T05:49:09Z","timestamp":1743054549612,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031710322"},{"type":"electronic","value":"9783031710339"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-71033-9_6","type":"book-chapter","created":{"date-parts":[[2024,9,3]],"date-time":"2024-09-03T00:02:17Z","timestamp":1725321737000},"page":"89-107","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Fair Division with\u00a0Bounded Sharing: Binary and\u00a0Non-degenerate Valuations"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3471-5402","authenticated-orcid":false,"given":"Samuel","family":"Bismuth","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2291-2556","authenticated-orcid":false,"given":"Ivan","family":"Bliznets","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7497-5834","authenticated-orcid":false,"given":"Erel","family":"Segal-Halevi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,8,31]]},"reference":[{"key":"6_CR1","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/J.ARTINT.2015.06.002","volume":"227","author":"H Aziz","year":"2015","unstructured":"Aziz, H., Gaspers, S., Mackenzie, S., Walsh, T.: Fair assignment of indivisible objects under ordinal preferences. Artif. Intell. 227, 71\u201392 (2015). https:\/\/doi.org\/10.1016\/J.ARTINT.2015.06.002","journal-title":"Artif. Intell."},{"key":"6_CR2","unstructured":"Bismuth, S., Bliznets, I., Segal-Halevi, E.: Fair division with bounded sharing: binary and non-degenerate valuations (2024). https:\/\/arxiv.org\/abs\/1912.00459"},{"key":"6_CR3","doi-asserted-by":"publisher","unstructured":"Bismuth, S., Makarov, V., Segal-Halevi, E., Shapira, D.: Uniform machines scheduling with bounded splittable jobs. CoRR abs\/2204.11753 (2022). https:\/\/doi.org\/10.48550\/ARXIV.2204.11753","DOI":"10.48550\/ARXIV.2204.11753"},{"key":"6_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/978-3-031-43254-5_13","volume-title":"Algorithmic Game Theory","author":"S Botan","year":"2023","unstructured":"Botan, S., Ritossa, A., Suzuki, M., Walsh, T.: Maximin fair allocation of indivisible items under cost utilities. In: Deligkas, A., Filos-Ratsikas, A. (eds.) SAGT 2023. LNCS, vol. 14238, pp. 221\u2013238. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-43254-5_13"},{"key":"6_CR5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511598975","volume-title":"Fair Division: From Cake Cutting to Dispute Resolution","author":"SJ Brams","year":"1996","unstructured":"Brams, S.J., Taylor, A.D.: Fair Division: From Cake Cutting to Dispute Resolution. Cambridge University Press, Cambridge (1996)"},{"key":"6_CR6","unstructured":"Brams, S.J., Taylor, A.D.: The Win-Win Solution: Guaranteeing Fair Shares to Everybody (Norton Paperback). W. W. Norton & Company, reprint edn. (2000)"},{"key":"6_CR7","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/J.MATHSOCSCI.2022.10.003","volume":"121","author":"F Camacho","year":"2023","unstructured":"Camacho, F., Fonseca-Delgado, R., P\u00e9rez, R.P., Tapia, G.: Generalized binary utility functions and fair allocations. Math. Soc. Sci. 121, 50\u201360 (2023). https:\/\/doi.org\/10.1016\/J.MATHSOCSCI.2022.10.003","journal-title":"Math. Soc. Sci."},{"issue":"1","key":"6_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3616009","volume":"71","author":"BR Chaudhury","year":"2024","unstructured":"Chaudhury, B.R., Garg, J., Mehlhorn, K.: EFX exists for three agents. J. ACM 71(1), 1\u201327 (2024)","journal-title":"J. ACM"},{"issue":"4","key":"6_CR9","doi-asserted-by":"publisher","first-page":"3357","DOI":"10.1287\/moor.2021.1249","volume":"47","author":"PW Goldberg","year":"2022","unstructured":"Goldberg, P.W., Hollender, A., Igarashi, A., Manurangsi, P., Suksompong, W.: Consensus halving for sets of items. Math. Oper. Res. 47(4), 3357\u20133379 (2022)","journal-title":"Math. Oper. Res."},{"issue":"4","key":"6_CR10","doi-asserted-by":"publisher","first-page":"3357","DOI":"10.1287\/moor.2021.1249","volume":"47","author":"PW Goldberg","year":"2022","unstructured":"Goldberg, P.W., Hollender, A., Igarashi, A., Manurangsi, P., Suksompong, W.: Consensus halving for sets of items. Math. Oper. Res. 47(4), 3357\u20133379 (2022). https:\/\/doi.org\/10.1287\/moor.2021.1249","journal-title":"Math. Oper. Res."},{"key":"6_CR11","doi-asserted-by":"publisher","unstructured":"Hosseini, H., Sikdar, S., Vaish, R., Wang, H., Xia, L.: Fair division through information withholding. In: The Thirty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2020, The Thirty-Second Innovative Applications of Artificial Intelligence Conference, IAAI 2020, The Tenth AAAI Symposium on Educational Advances in Artificial Intelligence, EAAI 2020, New York, NY, USA, 7\u201312 February 2020, pp. 2014\u20132021. AAAI Press (2020). https:\/\/doi.org\/10.1609\/AAAI.V34I02.5573","DOI":"10.1609\/AAAI.V34I02.5573"},{"issue":"4","key":"6_CR12","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1287\/MOOR.8.4.538","volume":"8","author":"HW Lenstra Jr","year":"1983","unstructured":"Lenstra, H.W., Jr.: Integer programming with a fixed number of variables. Math. Oper. Res. 8(4), 538\u2013548 (1983). https:\/\/doi.org\/10.1287\/MOOR.8.4.538","journal-title":"Math. Oper. Res."},{"key":"6_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/978-3-030-67731-2_31","volume-title":"SOFSEM 2021: Theory and Practice of Computer Science","author":"N Misra","year":"2021","unstructured":"Misra, N., Sethia, A.: Fair division is hard even for amicable agents. In: Bure\u0161, T., et al. (eds.) SOFSEM 2021. LNCS, vol. 12607, pp. 421\u2013430. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-67731-2_31"},{"key":"6_CR14","doi-asserted-by":"publisher","unstructured":"Moitra, A., O\u2019Donnell, R.: Pareto optimal solutions for smoothed analysts. In: Proceedings of the 43rd Annual ACM Symposium on Theory of Computing - STOC 2011 (2011). https:\/\/doi.org\/10.1145\/1993636.1993667","DOI":"10.1145\/1993636.1993667"},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"Orlin, J.B.: Improved algorithms for computing fisher\u2019s market clearing prices: computing fisher\u2019s market clearing prices. In: Proceedings of the Forty-Second ACM Symposium on Theory of Computing, pp. 291\u2013300. ACM (2010)","DOI":"10.1145\/1806689.1806731"},{"issue":"4","key":"6_CR16","doi-asserted-by":"publisher","first-page":"671","DOI":"10.2307\/1883182","volume":"92","author":"EA Pazner","year":"1978","unstructured":"Pazner, E.A., Schmeidler, D.: Egalitarian equivalent allocations: a new concept of economic equity. Quart. J. Econ. 92(4), 671\u2013687 (1978)","journal-title":"Quart. J. Econ."},{"issue":"3","key":"6_CR17","doi-asserted-by":"publisher","first-page":"1762","DOI":"10.1287\/opre.2022.2279","volume":"70","author":"F Sandomirskiy","year":"2022","unstructured":"Sandomirskiy, F., Segal-Halevi, E.: Efficient fair division with minimal sharing. Oper. Res. 70(3), 1762\u20131782 (2022)","journal-title":"Oper. Res."},{"key":"6_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/11537311_2","volume-title":"Fundamentals of Computation Theory","author":"DA Spielman","year":"2005","unstructured":"Spielman, D.A.: The smoothed analysis of algorithms. In: Li\u015bkiewicz, M., Reischuk, R. (eds.) FCT 2005. LNCS, vol. 3623, pp. 17\u201318. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11537311_2"},{"key":"6_CR19","unstructured":"Wilson, S.J.: Fair division using linear programming. Preprint, Departement of Mathematics, Iowa State University (1998)"}],"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-031-71033-9_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,3]],"date-time":"2024-09-03T00:03:41Z","timestamp":1725321821000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-71033-9_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031710322","9783031710339"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-71033-9_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"31 August 2024","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":"Amsterdam","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sagt2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cwi.nl\/en\/groups\/networks-and-optimization\/events\/sagt-2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}