{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T07:46:07Z","timestamp":1743061567257,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031164736"},{"type":"electronic","value":"9783031164743"}],"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-16474-3_59","type":"book-chapter","created":{"date-parts":[[2022,9,12]],"date-time":"2022-09-12T14:16:28Z","timestamp":1662992188000},"page":"727-738","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Envy Freeness Up\u00a0to\u00a0One Item: Shall We Duplicate or\u00a0Remove Resources?"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0047-1235","authenticated-orcid":false,"given":"Martin","family":"Aleksandrov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,9,13]]},"reference":[{"key":"59_CR1","unstructured":"Aleksandrov, M., Aziz, H., Gaspers, S., Walsh, T.: Online fair division: analysing a food bank problem. In: Proceedings of IJCAI 2015, Buenos Aires, Argentina, 25\u201331 July 2015, pp. 2540\u20132546 (2015). http:\/\/ijcai.org\/papers15\/Abstracts\/IJCAI15-360.html"},{"key":"59_CR2","doi-asserted-by":"publisher","unstructured":"Aleksandrov, M., Walsh, T.: Two algorithms for additive and fair division of mixed manna. In: KI 2020: Advances in Artificial Intelligence - 43th Annual German Conference on AI, Bamberg, Germany, 21\u201325 September 2020, Proceedings, pp. 44\u201357 (2020). https:\/\/doi.org\/10.1007\/978-3-030-58285-2_1","DOI":"10.1007\/978-3-030-58285-2_1"},{"key":"59_CR3","doi-asserted-by":"crossref","unstructured":"Aziz, H., Caragiannis, I., Igarashi, A., Walsh, T.: Fair allocation of indivisible goods and chores. In: Proceedings of the 28th International Joint Conference on Artificial Intelligence, pp. 53\u201359. IJCAI 2019, AAAI Press (2019). https:\/\/dl.acm.org\/doi\/abs\/10.5555\/3367032.3367041","DOI":"10.24963\/ijcai.2019\/8"},{"issue":"6","key":"59_CR4","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). https:\/\/doi.org\/10.1086\/664613","journal-title":"J. Polit. Econ."},{"issue":"5","key":"59_CR5","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). https:\/\/doi.org\/10.1257\/aer.102.5.2237","journal-title":"Am. Econ. Rev."},{"issue":"3","key":"59_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3355902","volume":"7","author":"I Caragiannis","year":"2019","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 (2019). https:\/\/doi.org\/10.1145\/3355902","journal-title":"ACM Trans. Econ. Comput."},{"key":"59_CR7","unstructured":"Chen, X., Liu, Z.: The fairness of leximin in allocation of indivisible chores. CoRR abs\/2005.04864 (2020). https:\/\/arxiv.org\/abs\/2005.04864"},{"issue":"1","key":"59_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2307\/2311357","volume":"68","author":"LE Dubins","year":"1961","unstructured":"Dubins, L.E., Spanier, E.H.: How to cut a cake fairly. Am. Math. Mon. 68(1), 1\u201317 (1961). https:\/\/doi.org\/10.2307\/2311357","journal-title":"Am. Math. Mon."},{"key":"59_CR9","unstructured":"Foley, D.K.: Resource allocation and the public sector. Yale Econ. Essays 7(1), 45\u201398 (1967). https:\/\/www.proquest.com\/openview\/cac1d2d0d079f04d1989726c2c2181fa\/1?pq-origsite=gscholar &cbl=18750 &diss=y"},{"key":"59_CR10","doi-asserted-by":"publisher","unstructured":"Lipton, R.J., Markakis, E., Mossel, E., Saberi, A.: On approximately fair allocations of indivisible goods. In: Proceedings Fifth ACM Conference on Electronic Commerce (EC-2004), New York, NY, USA, 17\u201320 May 2004, pp. 125\u2013131 (2004). https:\/\/doi.org\/10.1145\/988772.988792","DOI":"10.1145\/988772.988792"},{"key":"59_CR11","doi-asserted-by":"publisher","unstructured":"Pareto, V.: Cours d\u2019\u00e9conomie politique. \u0152uvres compl\u00e8tes publi\u00e9es sous la direction de giovanni busino. tomes 1 et 2 en un volume (1897). https:\/\/doi.org\/10.3917\/droz.paret.1964.01. 9782600040143","DOI":"10.3917\/droz.paret.1964.01"},{"key":"59_CR12","doi-asserted-by":"publisher","unstructured":"Plaut, B., Roughgarden, T.: Almost envy-freeness with general valuations. In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, New Orleans, LA, USA, 7\u201310 January 2018, pp. 2584\u20132603 (2018). https:\/\/doi.org\/10.1137\/19M124397X","DOI":"10.1137\/19M124397X"},{"key":"59_CR13","doi-asserted-by":"publisher","unstructured":"Tan, M., Dai, Z., Ren, Y., Walsh, T., Aleksandrov, M.: Minimal-envy conference paper assignment: formulation and a fast iterative algorithm. In: 2021 5th Asian Conference on Artificial Intelligence Technology (ACAIT), pp. 667\u2013674 (2021). https:\/\/doi.org\/10.1109\/ACAIT53529.2021.9731163","DOI":"10.1109\/ACAIT53529.2021.9731163"}],"container-title":["Lecture Notes in Computer Science","Progress in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-16474-3_59","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,12]],"date-time":"2022-09-12T14:25:42Z","timestamp":1662992742000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-16474-3_59"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031164736","9783031164743"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-16474-3_59","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":"13 September 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EPIA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"EPIA Conference on Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lisbon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","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":"31 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"epia2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/epia2022.inesc-id.pt\/","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":"85","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":"64","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":"75% - 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,7","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":"0,9","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)"}}]}}