Sciweavers

85 search results - page 10 / 17
» The Complexity of Bribery in Elections
Sort
View
AI
2007
Springer
13 years 7 months ago
Anyone but him: The complexity of precluding an alternative
Preference aggregation in a multiagent setting is a central issue in both human and computer contexts. In this paper, we study in terms of complexity the vulnerability of preferen...
Edith Hemaspaandra, Lane A. Hemaspaandra, Jör...
ATAL
2008
Springer
13 years 9 months ago
Complexity of terminating preference elicitation
Complexity theory is a useful tool to study computational issues surrounding the elicitation of preferences, as well as the strategic manipulation of elections aggregating togethe...
Toby Walsh
ECAI
2010
Springer
13 years 8 months ago
An Empirical Study of the Manipulability of Single Transferable Voting
Abstract. Voting is a simple mechanism to combine together the preferences of multiple agents. Agents may try to manipulate the result of voting by mis-reporting their preferences....
Toby Walsh
HICSS
2009
IEEE
138views Biometrics» more  HICSS 2009»
13 years 11 months ago
E-Voting System Security Optimization
Security of e-voting systems does not only depend on the voting protocol 1 or the software used but concerns the whole system with all its components. To guarantee security a holi...
Barbara Ondrisek
SIAMCOMP
1998
117views more  SIAMCOMP 1998»
13 years 7 months ago
The Queue-Read Queue-Write PRAM Model: Accounting for Contention in Parallel Algorithms
This paper introduces the queue-read, queue-write (qrqw) parallel random access machine (pram) model, which permits concurrent reading and writing to shared memory locations, but ...
Phillip B. Gibbons, Yossi Matias, Vijaya Ramachand...