{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,30]],"date-time":"2026-09-30T09:33:11Z","timestamp":1790760791427,"version":"4.1.0"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031393433","type":"print"},{"value":"9783031393440","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-39344-0_19","type":"book-chapter","created":{"date-parts":[[2023,8,25]],"date-time":"2023-08-25T20:27:10Z","timestamp":1692995230000},"page":"252-262","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["EFX Allocations Exist for\u00a0Binary Valuations"],"prefix":"10.1007","author":[{"given":"Xiaolin","family":"Bu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jiaxin","family":"Song","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ziqi","family":"Yu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,8,26]]},"reference":[{"issue":"2","key":"19_CR1","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1257\/000282805774670167","volume":"95","author":"A Abdulkadiro\u011flu","year":"2005","unstructured":"Abdulkadiro\u011flu, A., Pathak, P.A., Roth, A.E.: The New York City high school match. Am. Econ. Rev. 95(2), 364\u2013367 (2005)","journal-title":"Am. Econ. Rev."},{"key":"19_CR2","unstructured":"Akrami, H., Chaudhury, B.R., Garg, J., Mehlhorn, K., Mehta, R.: EFX allocations: Simplifications and improvements. arXiv preprint arXiv:2205.07638 (2022)"},{"issue":"4","key":"19_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2781776","volume":"3","author":"Y Aumann","year":"2015","unstructured":"Aumann, Y., Dombb, Y.: The efficiency of fair division with connected pieces. ACM Trans. Econ. Comput. 3(4), 1\u201316 (2015)","journal-title":"ACM Trans. Econ. Comput."},{"key":"19_CR4","unstructured":"Aumann, Y., Dombb, Y., Hassidim, A.: Computing socially-efficient cake divisions. In: Proceedings of the International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS), pp. 343\u2013350 (2013)"},{"issue":"2","key":"19_CR5","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1016\/j.ejor.2022.10.013","volume":"307","author":"H Aziz","year":"2023","unstructured":"Aziz, H., Huang, X., Mattei, N., Segal-Halevi, E.: Computing welfare-maximizing fair allocations of indivisible goods. Eur. J. Oper. Res. 307(2), 773\u2013784 (2023)","journal-title":"Eur. J. Oper. Res."},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"Babaioff, M., Ezra, T., Feige, U.: Fair and truthful mechanisms for dichotomous valuations. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 35, pp. 5119\u20135126 (2021)","DOI":"10.1609\/aaai.v35i6.16647"},{"key":"19_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1007\/978-3-030-64946-3_25","volume-title":"Web and Internet Economics","author":"S Barman","year":"2020","unstructured":"Barman, S., Bhaskar, U., Shah, N.: Optimal bounds on the price of fairness for indivisible goods. In: Chen, X., Gravin, N., Hoefer, M., Mehta, R. (eds.) WINE 2020. LNCS, vol. 12495, pp. 356\u2013369. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64946-3_25"},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"Barman, S., Krishnamurthy, S.K., Vaish, R.: Finding fair and efficient allocations. In: Proceedings of the ACM Conference on Economics and Computation (EC), pp. 557\u2013574 (2018)","DOI":"10.1145\/3219166.3219176"},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"Bei, X., Chen, N., Hua, X., Tao, B., Yang, E.: Optimal proportional cake cutting with connected pieces. In: Proceedings of AAAI Conference on Artificial Intelligence (AAAI), pp. 1263\u20131269 (2012)","DOI":"10.1609\/aaai.v26i1.8243"},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"Bei, X., Chen, N., Huzhang, G., Tao, B., Wu, J.: Cake cutting: envy and truth. In: IJCAI, pp. 3625\u20133631 (2017)","DOI":"10.24963\/ijcai.2017\/507"},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"Bei, X., Li, Z., Liu, J., Liu, S., Lu, X.: Fair division of mixed divisible and indivisible goods. Artif. Intell. 293, 103436 (2021a)","DOI":"10.1016\/j.artint.2020.103436"},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"Bei, X., Lu, X., Manurangsi, P., Suksompong, W.: The price of fairness for indivisible goods. Theory Comput. Syst. 65(7), 1069\u20131093 (2021b)","DOI":"10.1007\/s00224-021-10039-8"},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"Berger, B., Cohen, A., Feldman, M., Fiat, A.: Almost full EFX exists for four agents. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 36, pp. 4826\u20134833 (2022)","DOI":"10.1609\/aaai.v36i5.20410"},{"key":"19_CR14","doi-asserted-by":"crossref","unstructured":"Brams, S.J., Feldman, M., Lai, J., Morgenstern, J., Procaccia, A.D.: On maxsum fair cake divisions. In: Proceedings of the AAAI Conference on Artificial Intelligence (AAAI), pp. 1285\u20131291 (2012)","DOI":"10.1609\/aaai.v26i1.8237"},{"key":"19_CR15","unstructured":"Bu, X., Li, Z., Liu, S., Song, J., Tao, B.: On the complexity of maximizing social welfare within fair allocations of indivisible goods. arXiv preprint arXiv:2205.14296 (2022)"},{"key":"19_CR16","doi-asserted-by":"publisher","unstructured":"Xiaolin, B., Song, J., Tao, B.: On existence of truthful fair cake cutting mechanisms. Artif. Intell. 319(2023), 103904 (2023). https:\/\/doi.org\/10.1016\/j.artint.2023.103904","DOI":"10.1016\/j.artint.2023.103904"},{"issue":"6","key":"19_CR17","doi-asserted-by":"publisher","first-page":"1061","DOI":"10.1086\/664613","volume":"119","author":"E Budish","year":"2011","unstructured":"Budish, E.: The combinatorial assignment problem: approximate competitive equilibrium from equal incomes. J. Polit. Econ. 119(6), 1061\u20131103 (2011)","journal-title":"J. Polit. Econ."},{"issue":"5","key":"19_CR18","doi-asserted-by":"publisher","first-page":"2237","DOI":"10.1257\/aer.102.5.2237","volume":"102","author":"E Budish","year":"2012","unstructured":"Budish, E., Cantillon, E.: The multi-unit assignment problem: theory and evidence from course allocation at harvard. Am. Econ. Rev. 102(5), 2237\u20132271 (2012)","journal-title":"Am. Econ. Rev."},{"key":"19_CR19","doi-asserted-by":"crossref","unstructured":"Caragiannis, I., Gravin, N., Huang, X.: Envy-freeness up to any item with high nash welfare: the virtue of donating items. In: Proceedings of the ACM Conference on Economics and Computation (EC), pp. 527\u2013545 (2019a)","DOI":"10.1145\/3328526.3329574"},{"issue":"4","key":"19_CR20","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1007\/s00224-011-9359-y","volume":"50","author":"I Caragiannis","year":"2012","unstructured":"Caragiannis, I., Kaklamanis, C., Kanellopoulos, P., Kyropoulou, M.: The efficiency of fair division. Theory Comput. Syst. 50(4), 589\u2013610 (2012)","journal-title":"Theory Comput. Syst."},{"key":"19_CR21","doi-asserted-by":"crossref","unstructured":"Caragiannis, I., Kurokawa, D., Moulin, H., Procaccia, A.D., Shah, N., Wang, J.: The unreasonable fairness of maximum nash welfare. ACM Trans. Econ. Comput. 7(3), 1\u201332 (2019b)","DOI":"10.1145\/3355902"},{"key":"19_CR22","doi-asserted-by":"crossref","unstructured":"Chaudhury, B.R., Garg, J., Mehlhorn, K.: EFX exists for three agents. In: Proceedings of the ACM Conference on Economics and Computation (EC), pp. 1\u201319 (2020)","DOI":"10.1145\/3391403.3399511"},{"issue":"4","key":"19_CR23","doi-asserted-by":"publisher","first-page":"1336","DOI":"10.1137\/20M1359134","volume":"50","author":"BR Chaudhury","year":"2021","unstructured":"Chaudhury, B.R., Kavitha, T., Mehlhorn, K., Sgouritsa, A.: A little charity guarantees almost envy-freeness. SIAM J. Comput. 50(4), 1336\u20131358 (2021)","journal-title":"SIAM J. Comput."},{"key":"19_CR24","doi-asserted-by":"crossref","unstructured":"Cohler, Y.J., Lai, J.K., Parkes, D.S., Procaccia, A.D.: Optimal envy-free cake cutting. In: Proceedings of AAAI Conference on Artificial Intelligence (AAAI), pp. 626\u2013631 (2011)","DOI":"10.1609\/aaai.v25i1.7874"},{"key":"19_CR25","doi-asserted-by":"crossref","unstructured":"Feldman, M., Mauras, S., Ponitka, T.: On optimal tradeoffs between EFX and nash welfare. arXiv preprint arXiv:2302.09633 (2023)","DOI":"10.1609\/aaai.v38i9.28826"},{"key":"19_CR26","unstructured":"Ghodsi, A., Zaharia, M., Hindman, B., Konwinski, A., Shenker, S., Stoica, I.: Dominant resource fairness: fair allocation of multiple resource types. In: Proceedings of USENIX Symposium on Networked Systems Design and Implementation (NSDI) (2011)"},{"key":"19_CR27","doi-asserted-by":"crossref","unstructured":"Lian, J.W., Mattei, N., Noble, R., Walsh, T.: The conference paper assignment problem: using order weighted averages to assign indivisible goods. In: Proceedings of the AAAI Conference on Artificial Intelligence (AAAI), pp. 1138\u20131145 (2018)","DOI":"10.1609\/aaai.v32i1.11484"},{"key":"19_CR28","doi-asserted-by":"crossref","unstructured":"Lipton, R., Markakis, E., Mossel, E., Saberi, A.: On approximately fair allocations of indivisible goods. In Proceedings of the ACM Conference on Electronic Commerce (EC), pp. 125\u2013131 (2004)","DOI":"10.1145\/988772.988792"},{"key":"19_CR29","doi-asserted-by":"crossref","unstructured":"Murhekar, A., Garg, J.: On fair and efficient allocations of indivisible goods. In: Proceedings of the AAAI Conference on Artificial Intelligence (AAAI), pp. 5595\u20135602 (2021)","DOI":"10.1609\/aaai.v35i6.16703"},{"issue":"2","key":"19_CR30","doi-asserted-by":"publisher","first-page":"1039","DOI":"10.1137\/19M124397X","volume":"34","author":"B Plaut","year":"2020","unstructured":"Plaut, B., Roughgarden, T.: Almost envy-freeness with general valuations. SIAM J. Discrete Math. 34(2), 1039\u20131068 (2020)","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"19_CR31","first-page":"101","volume":"16","author":"H Steinhaus","year":"1948","unstructured":"Steinhaus, H.: The problem of fair division. Econometrica 16(1), 101\u2013104 (1948)","journal-title":"Econometrica"},{"issue":"1949","key":"19_CR32","doi-asserted-by":"publisher","first-page":"315","DOI":"10.2307\/1907319","volume":"17","author":"H Steinhaus","year":"1949","unstructured":"Steinhaus, H.: Sur la division pragmatique. Econometrica 17(1949), 315\u2013319 (1949)","journal-title":"Econometrica"},{"key":"19_CR33","doi-asserted-by":"crossref","unstructured":"Tao, B.: On existence of truthful fair cake cutting mechanisms. In: Proceedings of the 23rd ACM Conference on Economics and Computation, pp. 404\u2013434 (2022)","DOI":"10.1145\/3490486.3538321"}],"container-title":["Lecture Notes in Computer Science","Frontiers of Algorithmics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-39344-0_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,26]],"date-time":"2024-10-26T22:04:14Z","timestamp":1729980254000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-39344-0_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031393433","9783031393440"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-39344-0_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"26 August 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IJTCS-FAW","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Frontiers in Algorithmics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Macau","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 August 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 August 2023","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":"faw2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conferences.cis.um.edu.mo\/ijtcs2023\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"34","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":"21","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":"62% - 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":"4","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}