{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T16:06:11Z","timestamp":1743091571652,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":16,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819983902"},{"type":"electronic","value":"9789819983919"}],"license":[{"start":{"date-parts":[[2023,11,27]],"date-time":"2023-11-27T00:00:00Z","timestamp":1701043200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,11,27]],"date-time":"2023-11-27T00:00:00Z","timestamp":1701043200000},"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-981-99-8391-9_27","type":"book-chapter","created":{"date-parts":[[2023,11,26]],"date-time":"2023-11-26T16:02:21Z","timestamp":1701014541000},"page":"338-349","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Limiting Inequalities in Repeated House and Task Allocation"],"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":[[2023,11,27]]},"reference":[{"key":"27_CR1","doi-asserted-by":"publisher","unstructured":"Abdulkadiro\u011flu, A., S\u00f6nmez, T.: House allocation with existing tenants. J. Econ. Theory 88(2), 233\u2013260 (1999). https:\/\/doi.org\/10.1006\/jeth.1999.2553, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S002205319992553X","DOI":"10.1006\/jeth.1999.2553"},{"issue":"5","key":"27_CR2","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1016\/j.orl.2020.07.005","volume":"48","author":"H Aziz","year":"2020","unstructured":"Aziz, H., Moulin, H., Sandomirskiy, F.: A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocation. Oper. Res. Lett. 48(5), 573\u2013578 (2020). https:\/\/doi.org\/10.1016\/j.orl.2020.07.005","journal-title":"Oper. Res. Lett."},{"key":"27_CR3","doi-asserted-by":"crossref","unstructured":"Aziz, H., Rey, S.: Almost group envy-free allocation of indivisible goods and chores. In: Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, pp. 39\u201345. IJCAI\u201920, IJCAI Press (2021). https:\/\/dl.acm.org\/doi\/abs\/10.5555\/3491440.3491446","DOI":"10.24963\/ijcai.2020\/6"},{"key":"27_CR4","doi-asserted-by":"publisher","unstructured":"Brams, S.J., Taylor, A.D.: Fair Division - From Cake-Cutting to Dispute Resolution. Cambridge University Press, Cambridge (1996). https:\/\/doi.org\/10.1017\/CBO9780511598975","DOI":"10.1017\/CBO9780511598975"},{"issue":"4","key":"27_CR5","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). https:\/\/doi.org\/10.1007\/s00224-011-9359-y","journal-title":"Theory Comput. Syst."},{"key":"27_CR6","doi-asserted-by":"publisher","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) (2019). https:\/\/doi.org\/10.1145\/3355902","DOI":"10.1145\/3355902"},{"key":"27_CR7","unstructured":"Foley, D.K.: Resource allocation and the public sector. Yale Econ. Essays 7(1), 45\u201398 (1967). https:\/\/www.proquest.com\/docview\/302230213?pq-origsite=gscholar&fromopenview=true"},{"key":"27_CR8","doi-asserted-by":"crossref","unstructured":"Freeman, R., Sikdar, S., Vaish, R., Xia, L.: Equitable allocations of indivisible goods. In: Proceedings of the 28th International Joint Conference on Artificial Intelligence, pp. 280\u2013286. IJCAI\u201919, AAAI Press (2019). https:\/\/dl.acm.org\/doi\/10.5555\/3367032.3367073","DOI":"10.24963\/ijcai.2019\/40"},{"key":"27_CR9","unstructured":"Freeman, R., Sikdar, S., Vaish, R., Xia, L.: Equitable allocations of indivisible chores. In: Proceedings of the 19th International Conference on Autonomous Agents and MultiAgent Systems, pp. 384\u2013392. AAMAS \u201920, IFAAMAS, Richland, SC (2020). https:\/\/dl.acm.org\/doi\/10.5555\/3398761.3398810"},{"key":"27_CR10","unstructured":"Gourv\u00e8s, L., Monnot, J., Tlilane, L.: Near fairness in matroids. In: Proceedings of the Twenty-First European Conference on Artificial Intelligence, pp. 393\u2013398. ECAI\u201914, IOS Press, NLD (2014). https:\/\/dl.acm.org\/doi\/10.5555\/3006652.3006719"},{"key":"27_CR11","doi-asserted-by":"publisher","unstructured":"Herreiner, D., Puppe, C.: Envy freeness in experimental fair division problems. Theory Decis. 67 (2005). https:\/\/doi.org\/10.1007\/s11238-007-9069-8","DOI":"10.1007\/s11238-007-9069-8"},{"key":"27_CR12","unstructured":"Igarashi, A., Lackner, M., Nardi, O., Novaro, A.: Repeated fair allocation of indivisible items (2023). https:\/\/arxiv.org\/abs\/2304.01644"},{"key":"27_CR13","doi-asserted-by":"publisher","unstructured":"Krynke, M., Mielczarek, K., Va\u0161ko, A.: Analysis of the problem of staff allocation to work stations. In: Conference Quality Production Improvement - CQPI, vol. 1, no. 1, pp. 545\u2013550 (2019). https:\/\/doi.org\/10.2478\/cqpi-2019-0073","DOI":"10.2478\/cqpi-2019-0073"},{"key":"27_CR14","doi-asserted-by":"crossref","unstructured":"Lipton, R.J., Markakis, E., Mossel, E., Saberi, A.: On approximately fair allocations of indivisible goods. In: Proceedings of the 5th ACM Conference on Electronic Commerce, New York, USA, 17\u201320 May 2004, pp. 125\u2013131 (2004). https:\/\/dl.acm.org\/doi\/10.1145\/988772.988792","DOI":"10.1145\/988772.988792"},{"key":"27_CR15","unstructured":"Pareto, V.: Cours d\u2019\u00c9conomie politique. Professeur \u00e0 l\u2019Universit\u00e9 de Lausanne, Vol. I, pp. 430. 1896. Vol. II, pp. 426. 1897, F. Rouge, Lausanne (1897). https:\/\/www.cairn.info\/cours-d-economie-politique-tomes-1-et-2-9782600040143.htm"},{"issue":"2","key":"27_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). https:\/\/doi.org\/10.1137\/19M124397X","journal-title":"SIAM J. Discret. Math."}],"container-title":["Lecture Notes in Computer Science","AI 2023: Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-99-8391-9_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T18:46:51Z","timestamp":1710355611000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-99-8391-9_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,27]]},"ISBN":["9789819983902","9789819983919"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-981-99-8391-9_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023,11,27]]},"assertion":[{"value":"27 November 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australasian Joint Conference on Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brisbane, QLD","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","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":"28 November 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ausai2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ajcai2023.org\/","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":"213","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":"23","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":"59","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":"11% - 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":"3","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)"}}]}}