58368

Автор(ы): 

Карпов А. В. (ИПУ РАН, Лаборатория 25)
Faliszewski P. (AGH University)
Образцова С. (Наньянский Технологический Университет)

Автор(ов): 

3

Параметры публикации

Тип публикации: 

Доклад

Название: 

The Complexity of Election Problems with Group-Separable Preferences

Электронная публикация: 

Да

ISBN/ISSN: 

978-0-9992411-6-5

Наименование конференции: 

  • 29th International Joint Conference on Artificial Intelligence (IJCAI-20)

Наименование источника: 

  • Proceedings of the 29th International Joint Conference on Artificial Intelligence (IJCAI-20)

Город: 

  • Фрайбург, Германия

Издательство: 

  • International Joint Conferences on Artificial Intelligence

Год издания: 

2020

Страницы: 

203-209
Аннотация
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.

Библиографическая ссылка: 

Карпов А.В., Faliszewski P., Образцова С. The Complexity of Election Problems with Group-Separable Preferences / Proceedings of the 29th International Joint Conference on Artificial Intelligence (IJCAI-20). Фрайбург, Германия: International Joint Conferences on Artificial Intelligence, 2020. С. 203-209.