{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,7]],"date-time":"2024-08-07T07:41:35Z","timestamp":1723016495801},"publisher-location":"California","reference-count":0,"publisher":"International Joint Conferences on Artificial Intelligence Organization","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,8]]},"abstract":"<jats:p>For the assignment problem where multiple indivisible items are allocated to a group of agents given their ordinal preferences, we design randomized mechanisms that satisfy first-choice maximality (FCM), i.e., maximizing the number of agents assigned their first choices, together with Pareto efficiency (PE). Our mechanisms also provide guarantees of ex-ante and ex-post fairness. The generalized eager Boston mechanism is ex-ante envy-free, and ex-post envy-free up to one item (EF1). The generalized probabilistic Boston mechanism is also ex-post EF1, and satisfies ex-ante efficiency instead of fairness. We also show that no strategyproof mechanism satisfies ex-post PE, EF1, and FCM simultaneously. In doing so, we expand the frontiers of simultaneously providing efficiency and both ex-ante and ex-post fairness guarantees for the assignment problem.<\/jats:p>","DOI":"10.24963\/ijcai.2023\/303","type":"proceedings-article","created":{"date-parts":[[2023,8,11]],"date-time":"2023-08-11T08:31:30Z","timestamp":1691742690000},"page":"2719-2727","source":"Crossref","is-referenced-by-count":0,"title":["First-Choice Maximality Meets Ex-ante and Ex-post Fairness"],"prefix":"10.24963","author":[{"given":"Xiaoxi","family":"Guo","sequence":"first","affiliation":[{"name":"Key Laboratory of High Confidence Software Technologies (MOE), School of Computer Science, Peking University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sujoy","family":"Sikdar","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Binghamton University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lirong","family":"Xia","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Rensselaer Polytechnic Institute"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yongzhi","family":"Cao","sequence":"additional","affiliation":[{"name":"Key Laboratory of High Confidence Software Technologies (MOE), School of Computer Science, Peking University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hanpin","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Cyber Engineering, Guangzhou University"},{"name":"Key Laboratory of High Confidence Software Technologies (MOE), School of Computer Science, Peking University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"10584","event":{"number":"32","sponsor":["International Joint Conferences on Artificial Intelligence Organization (IJCAI)"],"acronym":"IJCAI-2023","name":"Thirty-Second International Joint Conference on Artificial Intelligence {IJCAI-23}","start":{"date-parts":[[2023,8,19]]},"theme":"Artificial Intelligence","location":"Macau, SAR China","end":{"date-parts":[[2023,8,25]]}},"container-title":["Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence"],"original-title":[],"deposited":{"date-parts":[[2023,8,11]],"date-time":"2023-08-11T08:44:50Z","timestamp":1691743490000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.ijcai.org\/proceedings\/2023\/303"}},"subtitle":[],"proceedings-subject":"Artificial Intelligence Research Articles","short-title":[],"issued":{"date-parts":[[2023,8]]},"references-count":0,"URL":"https:\/\/doi.org\/10.24963\/ijcai.2023\/303","relation":{},"subject":[],"published":{"date-parts":[[2023,8]]}}}