Sciweavers

13457 search results - page 18 / 2692
» Can we elect if we cannot compare
Sort
View
EUROCRYPT
1997
Springer
13 years 11 months ago
A Secure and Optimally Efficient Multi-Authority Election Scheme
In this paper we present a new multi-authority secret-ballot election scheme that guarantees privacy, universal verifiability, and robustness. It is the first scheme for which the ...
Ronald Cramer, Rosario Gennaro, Berry Schoenmakers
CORR
2002
Springer
125views Education» more  CORR 2002»
13 years 7 months ago
Complexity of Manipulating Elections with Few Candidates
In multiagent settings where the agents have different preferences, preference aggregation is a central issue. Voting is a general method for preference aggregation, but seminal r...
Vincent Conitzer, Tuomas Sandholm
BIRTHDAY
2005
Springer
14 years 1 months ago
A Modal View on Polder Politics
To get a better understanding of the influence of the media on current political events, researchers in Communication Science have recently reported on several case studies, in w...
Wouter van Atteveldt, Stefan Schlobach
ESA
2003
Springer
99views Algorithms» more  ESA 2003»
14 years 22 days ago
Adversary Immune Leader Election in ad hoc Radio Networks
Abstract. Recently, efficient leader election algorithms for ad hoc radio networks with low time complexity and energy cost have been designed even for the no-collision detection,...
Miroslaw Kutylowski, Wojciech Rutkowski
CORR
2012
Springer
249views Education» more  CORR 2012»
12 years 3 months ago
Controlling Candidate-Sequential Elections
All previous work on “candidate-control” manipulation of elections has been in the model of full-information, simultaneous voting. This is a problem, since in quite a few real...
Edith Hemaspaandra, Lane A. Hemaspaandra, Jör...