• A
  • A
  • A
  • ABC
  • ABC
  • ABC
  • А
  • А
  • А
  • А
  • А
Regular version of the site

Book chapter

The Complexity of Election Problems with Group-Separable Preferences

P. 203-209.
Karpov A. V., Obraztsova S., Faliszewski P.

We analyze the complexity of several NP-hard election-related problems under the assumptions that the voters have group-separable preferences. We show that under this assumption our problems typically remain NP-hard, but we provide more efficient algorithms if additionally the clone decomposition tree is of moderate height.

In book

International Joint Conferences on Artificial Intelligence, 2020.