40171

Автор(ы): 

Автор(ов): 

1

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

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

Статья в журнале/сборнике

Название: 

Computational complexity of manipulation: A survey

ISBN/ISSN: 

0005-1179

DOI: 

10.1134/S0005117916030012

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

  • Automation and Remote Control

Обозначение и номер тома: 

Т. 77, № 3

Город: 

  • Berlin

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

  • Pleiades Publishing, Ltd.

Год издания: 

2016

Страницы: 

369-388
Аннотация
In situations when a group of people has to make a decision based on the set of individual preferences, they use a certain aggregation method, in particular, voting. One of the main problems for any non-dictatorial social choice rule is the possibility for the voters to achieve a more preferable outcome of the voting by misrepresenting their preferences. Such actions on behalf of the voters are called manipulation, or strategic voting. One approach used to compare social choice rules in terms of how hard they are to manipulate is to find the complexity classes of manipulation problems for a given aggregation method. In this work, we present a survey of the studies of complexity classes of manipulation problems under various model assumptions and constraints.

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

Веселова Ю.А. Computational complexity of manipulation: A survey // Automation and Remote Control. 2016. Т. 77, № 3. С. 369-388.

Публикация имеет версию на другом языке или вышла в другом издании, например, в электронной (или онлайн) версии журнала: 

Да

Связь с публикацией: