Is computational complexity a barrier to manipulation?
نویسندگان
چکیده
منابع مشابه
Computational Complexity of Unweighted Coalitional Manipulation
In this chapter, we will study the computational complexity of manipuation for three common voting rules. We will prove that the unweighted coalitional manipulation problem (Definition 3.1.2) is NP-complete for maximin (Section 4.1) and ranked pairs (Section 4.2), and we will give a polynomial-time algorithm for UCM for Bucklin (Section 4.3). 4.1 Manipulation for Maximin is NP-complete In this ...
متن کاملTask Complexity Manipulation and Accuracy in Writing Performance
This study aimed to investigate the impact of task sequencing, along +/- reasoning demands dimension, on writing task performance in terms of accuracy. The study was motivated by Robinson’s Cognition Hypothesis (CH) as well as previous studies investigating the relationships between task complexity and second language production. The participants of the study were 90 intermediate students at t...
متن کاملA Short Introduction to Implicit Computational Complexity
These lecture notes are meant to serve as a short introduction to implicit computational complexity for those students who have little or no knowledge of recursion theory and proof theory. They have been obtained by enriching and polishing a set of notes the author wrote for a course (on the same subject) he gave at ESSLLI 2010. These notes are definitely not meant to be comprehensive nor exhau...
متن کاملUse Complexity to Avoid Vote Manipulation
Aggregating the preferences of self-interested agents is a key problem for multiagent systems. A common method for doing so is to vote over the candidates. Unfortunately, the Gibbard-Satterthwaite’s theorem shows that when there are more than three candidates, every nondictorial voting scheme for choosing the winning candidate is manipulable (in other words, there exist situations so that some ...
متن کاملOn the Computational Complexity of the Domination Game
The domination game is played on an arbitrary graph $G$ by two players, Dominator and Staller. It is known that verifying whether the game domination number of a graph is bounded by a given integer $k$ is PSPACE-complete. On the other hand, it is showed in this paper that the problem can be solved for a graph $G$ in $mathcal O(Delta(G)cdot |V(G)|^k)$ time. In the special case when $k=3$ and the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Mathematics and Artificial Intelligence
سال: 2011
ISSN: 1012-2443,1573-7470
DOI: 10.1007/s10472-011-9255-9