| |
|
|
| |
| |
|
Date Reviewed |
|
| |
1 - 10 of 24
reviews
|
|
|
 |
|
|
|
|
 Local distance restricted bribery in voting
Dey P. AAMAS 2019 (Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, Montreal, QC, Canada, May 13-17, 2019) 1925-1927, 2019. Type: Proceedings
The bribery problem asks whether there exists an appropriate-“cost” collection of voters in an election such that, if one strategically changes their votes, one’s favored candidate will win. In that model,...
|
Jul 6 2020 |
|
|
|
|
|
|
Manipulative design of scoring systems
Baumeister D., Hogrebe T. AAMAS 2019 (Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, Montreal, QC, Canada, May 13-17, 2019) 1814-1816, 2019. Type: Proceedings
Scoring systems, where each candidate gets a number of points from each voter based on the candidate’s position in the voter’s vote, are the most important broad class of voting rules. For example, plurality electio...
|
Apr 28 2020 |
|
|
|
|
|
|
General tiebreaking schemes for computational social choice
Freeman R., Brill M., Conitzer V. AAMAS 2015 (Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, Istanbul, Turkey, May 4-8, 2015) 1401-1409, 2015. Type: Proceedings
Tiebreaking is a natural issue in social choice and in computational social choice. However, with the passing of time, it has become more and more clear that tiebreaking is a quite important and subtle issue, and that in some cases one...
|
May 23 2016 |
|
|
|
|
|
|
Voter dissatisfaction in committee elections
Baumeister D., Dennisen S. AAMAS 2015 (Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, Istanbul, Turkey, May 4-8, 2015) 1707-1708, 2015. Type: Proceedings
Much of the research on elections focuses on selecting a single winner or having a tied set of winners to be thinned to a single winner by some tie-breaking procedure. There is also substantial research interest in, and a real-world ne...
|
Jun 30 2015 |
|
|
|
|
|
|
Bribery in multiple-adversary path-disruption games is hard for the second level of the polynomial hierarchy
Marple A., Rey A., Rothe J. AAMAS 2014 (Proceedings of the 2014 International Conference on Autonomous Agents and Multi-agent Systems, Paris, France, May 5-9, 2014) 1375-1376, 2014. Type: Proceedings
Nondeterministic polynomial time (NP) and NP-completeness are by now widely familiar notions within the general computer science (CS) community. Every CS undergraduate knows many examples of NP-complete problems. In contrast, most comp...
|
Jun 25 2015 |
|
|
|
|
|
|
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 |
|
|
|
|
|
|
Taking the final step to a full dichotomy of the possible winner problem in pure scoring rules
Baumeister D., Rothe J. Information Processing Letters 112(5): 186-190, 2012. Type: Article
There has quite naturally been much interest in studying the computational difficulties in trying to manipulate elections. This paper looks at a case that had not been classified in any of the earlier work: the difficulty of manipulati...
|
Jun 25 2012 |
|
|
|
|
|
|
The complexity of voter partition in Bucklin and fallback voting: solving three open problems
Erdélyi G., Piras L., Rothe J. AAMAS 2011 (The 10th International Conference on Autonomous Agents and Multiagent Systems, Taipei, Taiwan, May 2-6, 2011) 837-844, 2011. Type: Proceedings
In election control, a “chair” has the ability to make certain decisions in the structure of the election, with the goal of enabling a given candidate to win. These decisions involve adding, deleting, or partitionin...
|
Jun 21 2012 |
|
|
|
|
|
| |
|
|
| |
|
|
