44 search results - page 1 / 9 » Detecting Possible Manipulators in Elections |
178
Voted
TDSC
2011
14 years 5 months ago
2011
—In this paper, we study leader election in the presence of selfish nodes for intrusion detection in mobile ad hoc networks (MANETs). To balance the resource consumption among a...
87
Voted
USS
2008
15 years 17 days ago
2008
Optical scan electronic voting machines employ software components that are customized for each specific election. Such software components are critical from a security and integr...
77
Voted
AAAI
2007
15 years 17 days ago
2007
Uncertainty arises in preference aggregation in several ways. There may, for example, be uncertainty in the votes or the voting rule. Such uncertainty can introduce computational ...
82
Voted
CORR
2010
Springer
14 years 10 months ago
2010
Springer
One possible escape from the Gibbard-Satterthwaite theorem is computational complexity. For example, it is NP-hard to compute if the STV rule can be manipulated. However, there is...
91
Voted
SIGECOM
2008
ACM
14 years 10 months ago
2008
ACM
We introduce a class of voting rules called generalized scoring rules. Under such a rule, each vote generates a vector of k scores, and the outcome of the voting rule is based onl...