Search for Author All Reviews
	Elkind, Edith     Options: All Media Types Journals Proceedings Div Books Whole Books Other Date Reviewed Title Author Publisher Published Date Descending Ascending Date Reviewed     1 - 3 of 3 reviews       On the hardness of finding subsets with equal average Elkind E., Orlin J. Information Processing Letters 113(13): 477-480, 2013.  Type: Article This paper proves that, given a set of positive integers, it is nondeterministic polynomial time (NP)-complete to determine whether there are two nonidentical (although possibly overlapping) subsets of that set such that the average of...... Dec 5 2014     Optimal manipulation of voting rules Obraztsova S., Elkind E.  AAMAS 2012 (Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems, Valencia, Spain, Jun 4-8, 2012) 619-626, 2012.  Type: Proceedings More than 20 years ago, a series of papers by Bartholdi, Tovey, and Trick started a line of intense study of the computational complexity of two types of attacks on elections--control and manipulation. In manipulation, one has...... Feb 28 2013     Manipulation under voting rule uncertainty Elkind E., Erdélyi G.  AAMAS 2012 (Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems, Valencia, Spain, Jun 4-8, 2012) 627-634, 2012.  Type: Proceedings There is a long line of research studying the computational complexity of manipulating elections. This line dates back to seminal papers of Bartholdi, Orlin, Tovey, and Trick from two decades ago. The paper reviewed here adds an intere...... Jan 10 2013
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy