• A
  • A
  • A
  • АБВ
  • АБВ
  • АБВ
  • A
  • A
  • A
  • A
  • A
Обычная версия сайта
  • RU
  • EN
  • HSE University
  • Publications
  • Book chapter
  • Вычислительная сложность манипулирования в задаче голосования
  • RU
  • EN
Расширенный поиск
Высшая школа экономики
Национальный исследовательский университет
Priority areas
  • business informatics
  • economics
  • engineering science
  • humanitarian
  • IT and mathematics
  • law
  • management
  • mathematics
  • sociology
  • state and public administration
by year
  • 2027
  • 2026
  • 2025
  • 2024
  • 2023
  • 2022
  • 2021
  • 2020
  • 2019
  • 2018
  • 2017
  • 2016
  • 2015
  • 2014
  • 2013
  • 2012
  • 2011
  • 2010
  • 2009
  • 2008
  • 2007
  • 2006
  • 2005
  • 2004
  • 2003
  • 2002
  • 2001
  • 2000
  • 1999
  • 1998
  • 1997
  • 1996
  • 1995
  • 1994
  • 1993
  • 1992
  • 1991
  • 1990
  • 1989
  • 1988
  • 1987
  • 1986
  • 1985
  • 1984
  • 1983
  • 1982
  • 1981
  • 1980
  • 1979
  • 1978
  • 1977
  • 1976
  • 1975
  • 1974
  • 1973
  • 1972
  • 1971
  • 1970
  • 1969
  • 1968
  • 1967
  • 1966
  • 1965
  • 1964
  • 1963
  • 1958
  • More
Subject
News
July 24, 2026
'Physics Is What the World Is Literally Built On'
Physicist Nina Dzhanayeva, recipient of a Vladimir Potanin Foundation scholarship, focuses her research on nanophotonics. In this interview for the HSE Young Scientists project, she discusses nanowells, scientific intuition, and how physics can help in making frangipane cream puffs.
July 20, 2026
Scientists Create Open Dataset for Studying Concentration
A team of Russian researchers, including scientists from HSE University–St Petersburg, has developed the first open multimodal dataset containing recordings of brain activity, heart function, and video observations to help researchers understand what happens in the human brain during deep concentration. In the future, the dataset could accelerate the development of neural interfaces, rehabilitation technologies, and AI systems. The article has been published in Scientific Data.
July 20, 2026
‘Science Is Universal-It Knows No Borders
Fuad Aleskerov, Tenured Professor and Director of the International Centre of Decision Choice and Analysis at HSE University, together with his colleagues, has developed methods of network analysis in bibliometrics that have made it possible to identify patterns in the appearance and citation of publications in academic journals, as well as their influence on each other. When one or a number of studies are frequently cited by a wide range of journals, this is an indicator that the research is of high quality. By contrast, extensive cross-citation within a limited group of journals increases the likelihood of identifying a network of predatory publications.

 

Have you spotted a typo?
Highlight it, click Ctrl+Enter and send us a message. Thank you for your help!

Publications
  • Books
  • Articles
  • Chapters of books
  • Working papers
  • Report a publication
  • Research at HSE

?

Вычислительная сложность манипулирования в задаче голосования

.
Veselova Y. A.

When a society needs to take a collective decision one could apply some aggregation method, particularly, voting. One of the main problems with voting is manipulation. We say a voting rule is vulnerable to manipulation if there exists at least one voter who can achieve a better voting result by misrepresenting his or her preferences. The popular approach to comparing manipulability of voting rules is defining complexity class of the corresponding manipulation problem. This paper provides a survey into manipulation complexity literature considering variety of problems with different assumptions and restrictions.

Language: Russian
Full text
Keywords: коллективный выборsocial choiceвычислительная сложностьманипулированиеsocial choice rulesmanipulationправила коллективного выбораComputational Complexity
Publication based on the results of:
Theoretical and numerical study of advanced mathematical models in the social, economic, political and financial fields (2014)

In book

Фундаментальная информатика, информационные технологии и системы управления: реалии и перспективы. FIITM-2014: материалы международной науч.-практич. конф.
Фундаментальная информатика, информационные технологии и системы управления: реалии и перспективы. FIITM-2014: материалы международной науч.-практич. конф.
Красноярск: Сибирский федеральный университет, 2014.
Similar publications
Universal Comparison Methodology for Hough Transform Approaches
Kazimirov D., Vitalii Gulevskii, Kroshnin A. et al., Mathematics 2026 Article 1136
The Hough transform (HT) is widely used in computer vision, tomography, and neural networks. Numerous algorithms for HT computation have been proposed, making their systematic comparison essential. However, existing comparative methodologies are either non-universal and limited to certain HT formulations, or task-oriented, relying on application-specific criteria that do not fully capture algorithmic properties. This paper ...
Added: May 28, 2026
О СЛОЖНОСТИ ПРОБЛЕМЫ ТОТАЛЬНОЙ ВЫВОДИМОСТИ В НЕУКОРАЧИВАЮЩИХ И КОНТЕКСТНО-СВОБОДНЫХ ГРАММАТИКАХ
Dudakov S., Карлов Б. Н., Доклады Российской академии наук. Математика, информатика, процессы управления (ранее - Доклады Академии Наук. Математика) 2025 Т. 524 № 1 С. 11–18
In this paper we study the problem of total derivability in context-free, noncontracting, and context-sensitive grammars. Given a grammar and a terminal word, one has to determine whether there exists a derivation of this word which uses each production no less than a given number of times. It is proved that the problem of total ...
Added: March 18, 2026
О схлопывании вероятностных иерархий. I
Speranski S. O., Алгебра и логика 2013 Т. 52 № 2 С. 236–254
Изучаются иерархии проблем общезначимости для префиксных фрагментов вероятностной логики с кванторами по пропозициональным формулам, обозначаемой QPL, и её вариантов. Доказывается: если подполе F вещественных чисел определимо в стандартной модели арифметики посредством формулы второго порядка, не содержащей кванторов по множествам, то проблема общезначимости над F-значными вероятностными структурами для $\Sigma_4$-QPL-предложений является $\Pi^1_1$-полной и, как следствие, соответствующая иерархия проблем общезначимости схлопывается. Более того, при ...
Added: December 27, 2025
Некоторые классификации сложности задачи о вершинной 3-раскраске
Дахно Г. С., Malyshev D., Математические заметки 2026 Т. 119 № 3 С. 360–376
Наследственный класс — множество графов, замкнутое относительно удаления вершин. Каждый такой класс имеет каноническое описание посредством минимальных запрещенных порожденных фрагментов. Задача о вершинной 3-раскраске (задача 3-ВР) для заданного графа состоит в том, чтобы определить, а можно ли множество его вершин разбить на три подмножества попарно несмежных вершин. Известна дихотомия сложности этой задачи для всех наследственных ...
Added: November 26, 2025
NP-полнота игры “Ханаби” при минимальных параметрах
Onoprienko A., Доклады Российской академии наук. Математика, информатика, процессы управления (ранее - Доклады Академии Наук. Математика) 2025 № 527 С. 206–216
We study the algorithmic complexity of the cooperative card game Hanabi. The feature of Hanabi is that players see each other’s cards but not their own, and exchange information through hints. Even in the model with one player who has full information about the deck, Hanabi remains NP-hard. We found the minimal parameters ofthe game ...
Added: November 23, 2025
On one class of non-local aggregation rules
N. L. Polyakov, Shamolin M. V., Journal of Mathematical Sciences 2025 Vol. 292 No. 6 P. 793–803
The paper proves a number of properties of a class of non-local aggregation rules that simulate dynamic aggregation. The work is based on the clan approach in the theory of collective choice, which was proposed by S. Shelah and developed by the authors. ...
Added: October 8, 2025
Логики с аксиомой конвергентности: сложность при малом числе переменных в языке
Rybakov M., Щербаков М. И., В кн.: Четырнадцатые Смирновские чтения по логике: материалы Междунар. науч. конф., Москва, 19-21 июня 2025 г.: М.: Издатель Александр Воробьев, 2025. С. 46–49.
Логики с аксиомой конвергентности: сложность при малом числе переменных в языке ...
Added: June 21, 2025
Сложность константных фрагментов ненормальных модальных логик
Kudinov A., Rybakov M., В кн.: Четырнадцатые Смирновские чтения по логике: материалы Междунар. науч. конф., Москва, 19-21 июня 2025 г.: М.: Издатель Александр Воробьев, 2025. С. 36–39.
Показано, что каждая модальная логика, содержащая классическую логику высказываний и содержащаяся в слабой логике Гжегорчика, имеет NP-трудную проблему выполнимости для константного фрагмента. В частности, константные фрагменты ненормальных модальных логик E, EM, EN и EMN являются coNP-полными. ...
Added: June 21, 2025
Optimal Approximation of Average Reward Markov Decision Processes
Sapronov Y., Yudin N., Computational Mathematics and Mathematical Physics 2025 Vol. 65 No. 3 P. 567–581
We continue to develop the concept of studying the ε-optimal policy for Average Reward Markov Decision Processes (AMDP) by reducing it to Discounted Markov Decision Processes (DMDP). Existing research often stipulates that the discount factor must not fall below a certain threshold. Typically, this threshold is close to one, and as is well-known, iterative methods ...
Added: June 10, 2025
Information, interaction and manipulation in voting
Veselova Y. A., Maastricht: Maastricht University, 2023.
Collective decision-making is a part of everyday life in modern society. People invented a variety of voting procedures for aggregating individual preferences into a collective choice. However, the problem is that people can misrepresent their preferences in order to achieve a more preferable voting result. This phenomenon is called manipulation and is considered negative since ...
Added: February 26, 2025
Некоторые полные сложностные дихотомии для задачи о доминирующем множестве
Дахно Г. С., Malyshev D., Математические заметки 2025 Т. 117 № 1 С. 62–78
Наследственный класс — множество обыкновенных графов, замкнутое относительно удаления вершин, каждый такой класс задается множеством своих минимальных запрещенных порожденных подграфов. Задача о доминирующем множестве для заданного графа состоит в том, чтобы определить, а имеется ли в нем такое подмножество вершин заданного размера, что каждая вершина вне подмножества имеет хотя бы одного соседа в данном подмножестве. ...
Added: December 3, 2024
The Study of the Strategic Consequences of a Scoring Model Disclosure
Kryukov G. M., Sandomirskaia M., Automation and Remote Control 2024 Vol. 85 P. 696–710
In this paper, the disclosure of information about the scoring model is investigated. Some of the company’s customers find out their internal rating in the company. Such customers can change their behavior to increase their internal rating. The customers who are aware of the leakage are represented as players who can choose a strategy: whether ...
Added: November 19, 2024
Исследование стратегических последствий утечки скоринговой модели
Крюков Г. М., Sandomirskaia M., Автоматика и телемеханика 2024 № 8 С. 54–75
В данной статье моделируется раскрытие информации о скоринговой модели. Некоторые клиенты компании узнают свой внутренний рейтинг в компании. Такие клиенты могут изменить свое поведение, чтобы повысить свой внутренний рейтинг. Клиенты, знающие об утечке информации, являются игроками, которые могут выбирать стратегию: повышать ли свой внутренний рейтинг и если да, то насколько. Главная задача – найти в ...
Added: August 28, 2024
On efficient algorithms for bottleneck path problems with many sources
Kirill V. Kaymakov, Dmitry S. Malyshev, Optimization Letters 2024 Vol. 18 P. 1273–1283
For given edge-capacitated connected graph and two its vertices s and t, the bottleneck (or max min ) path problem is to find the maximum value of path-minimum edge capacities among all paths, connecting s and t. It can be generalized by finding the bottleneck values between s and all possible t. These problems arise ...
Added: April 18, 2024
Манипулятивные стратегии и тактики в китайских рекламных текстах
Osipov D., В кн.: Язык в межкультурном пространстве XXI века: взгляды и научные исследования, перспективы развития : Материалы Международной научно-практической конференцииВып. 1.: Астрахань: [б.и.], 2021. С. 112–118.
The article deals with the strategies and tactics of the verbal and non-verbal impact of advertising texts (Chinese commercials and ads), analyzes the manipulations in advertising products, highlights the nationally specific features of Chinese culture, which are also implemented in advertising. ...
Added: March 19, 2024
Аксиологическая прагматика мотивационного дискурса на материале речей американских коучей
Гаевская М. А., Moshnyaga E., Chikhacheva D., Вестник Челябинского государственного университета 2024 № 1 (483) С. 81–91
The article studies values representation peculiarities in American coaches’ motivation discourse. The research focuses on analyzing their speech tactics choices to gain the audience’s trust and indoctrinate them with necessary information. Through compiling and studying the corpus of examples the research results in specifying the notion of motivation discourse, detecting the core values of the American society ...
Added: March 6, 2024
A complete complexity dichotomy of the edge-coloring problem for all sets of 8-edge forbidden subgraphs
Malyshev D., Duginov O. I., Journal of Applied and Industrial Mathematics (перевод журналов "Сибирский журнал индустриальной математики" и "Дискретный анализ и исследование операций") 2023 Vol. 17 No. 4 P. 791–801
For a given graph, the edge-coloring problem is to minimize the number of colors sufficient to color all the graph edges so that any adjacent edges receive different colors. For all classes defined by sets of forbidden subgraphs, each with 7 edges, the complexity status of this problem is known. In this paper, we obtain ...
Added: February 16, 2024
Manipulability of Aggregation Procedures for the Case of Large Numbers of Voters
Ivanov A., , in: Data Analysis and Optimization. In Honor of Boris Mirkin's 80th Birthday.: Springer, 2023. P. 157–168.
Manipulation is a situation when an agent misrepresents his/her preferences to obtain a better result of an aggregation procedure. It was proven in literature, that there is no non-dictatorial aggregation procedure which is non-manipulable. A number of papers studying the degree of manipulability of aggregation procedures have been published since then. Such papers either look ...
Added: January 26, 2024
Алгоритмы расчета точных значений индексов манипулируемости для случая трех альтернатив
Ivanov A., Журнал Новой экономической ассоциации 2022 № 5(57) С. 14–23
Abstract. Manipulation is a phenomenon when an agent or a group of agents misrepresent her/their preferences in the ballots in order to obtain a better outcome of the social choice. It has been proven that there is no not-dictatorial social choice rule which is nonmanipulable. There are two approaches to fi nd the least manipulable ...
Added: January 26, 2024
Comparative Analysis of Logic Reasoning and Graph Neural Networks for Ontology-Mediated Query Answering with a Covering Axiom
Gerasimova O., Makarov I., Severin N., IEEE Access 2023 Vol. 11 P. 88074–88086
The problem of query answering over incomplete attributed graph data is a challenging field of database management systems and artificial intelligence. When there are rules on data structure expressed in the form of the ontology, the theoretical complexity of finding exact solution satisfying ontology constraints increases. Logic-based methods use theoretical constructions to obtain efficient rewritings ...
Added: January 5, 2024
  • About
  • About
  • Key Figures & Facts
  • Sustainability at HSE University
  • Faculties & Departments
  • International Partnerships
  • Faculty & Staff
  • HSE Buildings
  • HSE University for Persons with Disabilities
  • Public Enquiries
  • Studies
  • Admissions
  • Programme Catalogue
  • Undergraduate
  • Graduate
  • Exchange Programmes
  • Summer University
  • Summer Schools
  • Semester in Moscow
  • Business Internship
  • Research
  • International Laboratories
  • Research Centres
  • Research Projects
  • Monitoring Studies
  • Conferences & Seminars
  • Academic Jobs
  • Yasin (April) International Academic Conference on Economic and Social Development
  • Media & Resources
  • Publications by staff
  • HSE Journals
  • Publishing House
  • iq.hse.ru: commentary by HSE experts
  • Library
  • Economic & Social Data Archive
  • Video
  • HSE Repository of Socio-Economic Information
  • HSE1993–2026
  • Contacts
  • Copyright
  • Privacy Policy
  • Site Map
Edit