687 search results - page 8 / 138 » On The Complexity of Manipulating Elections |
STACS
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. It is well-known that no classical algorithm can solve exactly (i.e., in bounded time without error) the leader election problem in anonymous networks. This paper propose...
WSOM
2009
Springer
14 years 2 months ago
2009
Springer
The complex phenomena of political science are typically studied using qualitative approach, potentially supported by hypothesisdriven statistical analysis of some numerical data. ...
SIGECOM
2008
ACM
13 years 7 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...
EUROCRYPT
1997
Springer
13 years 11 months ago
1997
Springer
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 ...
IPL
2011
12 years 11 months ago
2011
We propose a probabilistic network model, called asynchronous bounded expected delay (ABE), which requires a known bound on the expected message delay. In ABE networks all asynchr...