{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:15:35Z","timestamp":1742912135828,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031066771"},{"type":"electronic","value":"9783031066788"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-06678-8_2","type":"book-chapter","created":{"date-parts":[[2022,5,28]],"date-time":"2022-05-28T23:03:31Z","timestamp":1653779011000},"page":"21-27","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the\u00a0Existence of\u00a0EFX Allocations"],"prefix":"10.1007","author":[{"given":"Bhaskar Ray","family":"Chaudhury","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,5,29]]},"reference":[{"key":"2_CR1","unstructured":"www.spliddit.org"},{"key":"2_CR2","unstructured":"www.fairoutcomes.com"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Anari, N., Mai, T., Gharan, S.O., Vazirani, V.V.: Nash social welfare for indivisible items under separable, piecewise-linear concave utilities. In: Proc. 29th Symp. Discrete Algorithms (SODA). pp. 2274\u20132290 (2018)","DOI":"10.1137\/1.9781611975031.147"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"B. Budish, E., Cantillon, E.: The multi-unit assignment problem: Theory and evidence from course allocation at harvard. American Economic Review 102 (2010)","DOI":"10.1257\/aer.102.5.2237"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Barman, S., Krishnamurthy, S.K., Vaish, R.: Finding fair and efficient allocations. In: Proceedings of the 19th ACM Conference on Economics and Computation (EC). pp. 557\u2013574 (2018)","DOI":"10.1145\/3219166.3219176"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Brams, S.J., Taylor, A.D.: Fair division - from cake-cutting to dispute resolution. Cambridge University Press (1996)","DOI":"10.1017\/CBO9780511598975"},{"key":"2_CR7","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. In: Proceedings of the 17th ACM Conference on Economics and Computation (EC). pp. 305\u2013322 (2016)","DOI":"10.1145\/2940716.2940726"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Chaudhury, B.R., Garg, J., Mehlhorn, K.: EFX exists for three agents. In: Proceedings of the 21st ACM Conference on Economics and Computation (EC). pp. 1\u201319. ACM (2020)","DOI":"10.1145\/3391403.3399511"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Chaudhury, B.R., Garg, J., Mehlhorn, K., Mehta, R., Misra, P.: Improving EFX guarantees through rainbow cycle number. In: Proceedings of the 22nd ACM Conference on Economics and Computation (EC). pp. 310\u2013311. ACM (2021)","DOI":"10.1145\/3465456.3467605"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Chaudhury, B.R., Garg, J., Mehta, R.: Fair and efficient allocations under subadditive valuations. In: Proc. of the 35th AAAI Conference on Artificial Intelligence (AAAI) (2021)","DOI":"10.1609\/aaai.v35i6.16665"},{"issue":"4","key":"2_CR11","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."},{"issue":"3","key":"2_CR12","doi-asserted-by":"publisher","first-page":"1211","DOI":"10.1137\/15M1053682","volume":"47","author":"R Cole","year":"2018","unstructured":"Cole, R., Gkatzelis, V.: Approximating the nash social welfare with indivisible items. SIAM J. Comput. 47(3), 1211\u20131236 (2018)","journal-title":"SIAM J. Comput."},{"key":"2_CR13","unstructured":"Etkin, R., Parekh, A., Tse, D.: Spectrum sharing for unlicensed bands. In: In Proceedings of the first IEEE Symposium on New Frontiers in Dynamic Spectrum Access Networks (2005)"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Garg, J., Kulkarni, P., Kulkarni, R.: Approximating Nash social welfare under submodular valuations through (un)matchings. In: Proc. of the 31st Symposium on Discrete Algorithms (SODA 2020) (2020), to appear","DOI":"10.1137\/1.9781611975994.163"},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Moulin, H.: Fair division in the internet age. Annual Review of Economics 11 (2019)","DOI":"10.1146\/annurev-economics-080218-025559"},{"issue":"2","key":"2_CR16","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. Discret. Math. 34(2), 1039\u20131068 (2020)","journal-title":"SIAM J. Discret. Math."},{"issue":"11","key":"2_CR17","doi-asserted-by":"publisher","first-page":"1293","DOI":"10.1287\/mnsc.36.11.1293","volume":"36","author":"JW Pratt","year":"1990","unstructured":"Pratt, J.W., Zeckhauser, R.J.: The fair and efficient division of the winsor family silver. Management Science 36(11), 1293\u20131301 (1990)","journal-title":"Management Science"},{"key":"2_CR18","doi-asserted-by":"publisher","unstructured":"Procaccia, A.D.: Technical perspective: An answer to fair division\u2019s most enigmatic question. Commun. ACM 63(4), \u00a0118 (Mar 2020). https:\/\/doi.org\/10.1145\/3382131, https:\/\/doi.org\/10.1145\/3382131","DOI":"10.1145\/3382131"},{"key":"2_CR19","first-page":"101","volume":"16","author":"H Steinhaus","year":"1948","unstructured":"Steinhaus, H.: The problem of fair division. Econometrica 16, 101\u2013104 (1948)","journal-title":"Econometrica"},{"key":"2_CR20","unstructured":"Vossen, T.W.: Fair allocation concepts in air traffic management. Ph.D. thesis, University of Maryland, College Park (2002)"},{"key":"2_CR21","unstructured":"Walras, L.: \u00c9l\u00e9ments d\u2019\u00e9conomie politique pure, ou th\u00e9orie de la richesse sociale (Elements of Pure Economics, or the theory of social wealth). Lausanne, Paris (1874), (1899, 4th ed.; 1926, rev ed., 1954, Engl. transl.)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-06678-8_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,6]],"date-time":"2023-02-06T17:01:17Z","timestamp":1675702877000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-06678-8_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031066771","9783031066788"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-06678-8_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"29 May 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Trier","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"33","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.informatik.uni-trier.de\/iwoca-2022","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":"OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"86","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":"35","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":"41% - 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":"10","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)"}}]}}