{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,14]],"date-time":"2025-05-14T09:51:14Z","timestamp":1747216274310,"version":"3.40.5"},"reference-count":0,"publisher":"IOS Press","isbn-type":[{"type":"print","value":"9781643684369"},{"type":"electronic","value":"9781643684376"}],"license":[{"start":{"date-parts":[[2023,9,28]],"date-time":"2023-09-28T00:00:00Z","timestamp":1695859200000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,9,28]]},"abstract":"<jats:p>We study the computational complexity of identifying a small agreeable subset of items. A subset of items is agreeable if every agent does not prefer its complement set. We study settings in which agents either can assign arbitrary utilities to the items; can approve or disapprove the items; or can rank the items (in which case we consider Borda utilities). We prove that deciding whether an agreeable set exists is NP-hard for all variants; and we perform a parameterized analysis regarding the following natural parameters: the number of agents, the number of items, and the upper bound on the size of the agreeable set in question.<\/jats:p>","DOI":"10.3233\/faia230285","type":"book-chapter","created":{"date-parts":[[2023,9,29]],"date-time":"2023-09-29T09:01:24Z","timestamp":1695978084000},"source":"Crossref","is-referenced-by-count":0,"title":["Efficiently Computing Smallest Agreeable Sets"],"prefix":"10.3233","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6303-6276","authenticated-orcid":false,"given":"Robert","family":"Bredereck","sequence":"first","affiliation":[{"name":"Institut f\u00fcr Informatik, TU Clausthal, Clausthal-Zellerfeld, Germany, Email: robert.bredereck@tu-clausthal.de, till.fluschnik@tu-clausthal.de"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2203-4386","authenticated-orcid":false,"given":"Till","family":"Fluschnik","sequence":"additional","affiliation":[{"name":"Institut f\u00fcr Informatik, TU Clausthal, Clausthal-Zellerfeld, Germany, Email: robert.bredereck@tu-clausthal.de, till.fluschnik@tu-clausthal.de"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7916-0979","authenticated-orcid":false,"given":"Nimrod","family":"Talmon","sequence":"additional","affiliation":[{"name":"Ben-Gurion University, Be\u2019er Sheva, Israel, Email: talmonn@bgu.ac.il"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"7437","container-title":["Frontiers in Artificial Intelligence and Applications","ECAI 2023"],"original-title":[],"link":[{"URL":"https:\/\/ebooks.iospress.nl\/pdf\/doi\/10.3233\/FAIA230285","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,29]],"date-time":"2023-09-29T09:01:27Z","timestamp":1695978087000},"score":1,"resource":{"primary":{"URL":"https:\/\/ebooks.iospress.nl\/doi\/10.3233\/FAIA230285"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,28]]},"ISBN":["9781643684369","9781643684376"],"references-count":0,"URL":"https:\/\/doi.org\/10.3233\/faia230285","relation":{},"ISSN":["0922-6389","1879-8314"],"issn-type":[{"type":"print","value":"0922-6389"},{"type":"electronic","value":"1879-8314"}],"subject":[],"published":{"date-parts":[[2023,9,28]]}}}