{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,7]],"date-time":"2024-08-07T07:34:50Z","timestamp":1723016090168},"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":[[2022,7]]},"abstract":"<jats:p>We consider multiwinner elections in Euclidean space using the minimax Chamberlin-Courant rule.\n\nIn this setting, voters and candidates are embedded in a d-dimensional Euclidean space,\n\nand the goal is to choose a committee of k candidates so that the rank of any voter's\n\nmost preferred candidate in the committee is minimized. (The problem is also equivalent to the \n\nordinal version of the classical k-center problem.) \n\nWe show that the problem is NP-hard in any dimension d &gt;= 2, and also provably hard to approximate.\n\nOur main results are three polynomial-time approximation schemes, each of which finds a committee \n\nwith provably good minimax score. In all cases, we show that our approximation bounds are tight or close to tight.\n\nWe mainly focus on the 1-Borda rule but some of our results also hold for the more general r-Borda.<\/jats:p>","DOI":"10.24963\/ijcai.2022\/68","type":"proceedings-article","created":{"date-parts":[[2022,7,16]],"date-time":"2022-07-16T02:55:56Z","timestamp":1657940156000},"page":"475-481","source":"Crossref","is-referenced-by-count":0,"title":["Multiwinner Elections under Minimax Chamberlin-Courant Rule in Euclidean Space"],"prefix":"10.24963","author":[{"given":"Chinmay","family":"Sonar","sequence":"first","affiliation":[{"name":"University of California, Santa Barbara"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Subhash","family":"Suri","sequence":"additional","affiliation":[{"name":"University of California, Santa Barbara"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jie","family":"Xue","sequence":"additional","affiliation":[{"name":"New York University, Shanghai"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"10584","event":{"number":"31","sponsor":["International Joint Conferences on Artificial Intelligence Organization (IJCAI)"],"acronym":"IJCAI-2022","name":"Thirty-First International Joint Conference on Artificial Intelligence {IJCAI-22}","start":{"date-parts":[[2022,7,23]]},"theme":"Artificial Intelligence","location":"Vienna, Austria","end":{"date-parts":[[2022,7,29]]}},"container-title":["Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence"],"original-title":[],"deposited":{"date-parts":[[2022,7,18]],"date-time":"2022-07-18T11:07:30Z","timestamp":1658142450000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.ijcai.org\/proceedings\/2022\/68"}},"subtitle":[],"proceedings-subject":"Artificial Intelligence Research Articles","short-title":[],"issued":{"date-parts":[[2022,7]]},"references-count":0,"URL":"https:\/\/doi.org\/10.24963\/ijcai.2022\/68","relation":{},"subject":[],"published":{"date-parts":[[2022,7]]}}}