Sciweavers

44 search results - page 1 / 9
» Detecting Possible Manipulators in Elections
Sort
View
TDSC
2011
12 years 10 months ago
Mechanism Design-Based Secure Leader Election Model for Intrusion Detection in MANET
—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...
Noman Mohammed, Hadi Otrok, Lingyu Wang, Mourad De...
USS
2008
13 years 6 months ago
Pre-Election Testing and Post-Election Audit of Optical Scan Voting Terminal Memory Cards
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...
Seda Davtyan, Sotiris Kentros, Aggelos Kiayias, La...
AAAI
2007
13 years 6 months ago
Uncertainty in Preference Elicitation and Aggregation
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 ...
Toby Walsh
CORR
2010
Springer
116views Education» more  CORR 2010»
13 years 3 months ago
Where are the hard manipulation problems?
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...
Toby Walsh
SIGECOM
2008
ACM
138views ECommerce» more  SIGECOM 2008»
13 years 3 months ago
Generalized scoring rules and the frequency of coalitional manipulability
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...
Lirong Xia, Vincent Conitzer