687 search results - page 12 / 138 » On The Complexity of Manipulating Elections |
SAGT
2010
Springer
14 years 10 months ago
2010
Springer
We investigate the computational aspects of safe manipulation, a new model of coalitional manipulation that was recently put forward by Slinko and White [11]. In this model, a pot...
ATAL
2007
Springer
15 years 6 months ago
2007
Springer
Recent results have established that a variety of voting rules are computationally hard to manipulate in the worst-case; this arguably provides some guarantee of resistance to man...
101
click to vote
CORR
1998
Springer
14 years 11 months ago
1998
Springer
This paper discusses the feasibility of using conguration space C-space as a means of visualization and control in operator-guided real-time motion of a robot arm manipulator. T...
133
Voted
AAMAS
2011
Springer
14 years 6 months ago
2011
Springer
The stable marriage problem is a well-known problem of matching men to women so that no man and woman who are not married to each other both prefer each other. Such a problem has a...
ALGORITHMICA
2000
14 years 11 months ago
2000
Complexity bounds for algorithms for robotic motion and manipulation can be misleading when they are constructed with pathological `worst-case' scenarios that rarely appear i...