Efficiently Computing Smallest Agreeable Sets

Robert Bredereck, Till Fluschnik, Nimrod Talmon

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


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.

Original languageEnglish
Title of host publicationECAI 2023 - 26th European Conference on Artificial Intelligence, including 12th Conference on Prestigious Applications of Intelligent Systems, PAIS 2023 - Proceedings
EditorsKobi Gal, Kobi Gal, Ann Nowe, Grzegorz J. Nalepa, Roy Fairstein, Roxana Radulescu
PublisherIOS Press BV
Number of pages8
ISBN (Electronic)9781643684369
StatePublished - 28 Sep 2023
Event26th European Conference on Artificial Intelligence, ECAI 2023 - Krakow, Poland
Duration: 30 Sep 20234 Oct 2023

Publication series

NameFrontiers in Artificial Intelligence and Applications
ISSN (Print)0922-6389
ISSN (Electronic)1879-8314


Conference26th European Conference on Artificial Intelligence, ECAI 2023

ASJC Scopus subject areas

  • Artificial Intelligence


Dive into the research topics of 'Efficiently Computing Smallest Agreeable Sets'. Together they form a unique fingerprint.

Cite this