Sciweavers

13457 search results - page 9 / 2692
» Can we elect if we cannot compare
Sort
View
AAAI
2010
13 years 9 months ago
Good Rationalizations of Voting Rules
The concept of distance rationalizability allows one to define new voting rules or "rationalize" existing ones via a consensus class of elections and a distance. A conse...
Edith Elkind, Piotr Faliszewski, Arkadii M. Slinko
JUCS
2006
124views more  JUCS 2006»
13 years 7 months ago
Variations on Itai-Rodeh Leader Election for Anonymous Rings and their Analysis in PRISM
Abstract: We present two probabilistic leader election algorithms for anonymous unidirectional rings with FIFO channels, based on an algorithm from Itai and Rodeh [Itai and Rodeh 1...
Wan Fokkink, Jun Pang
ICDAR
2009
IEEE
14 years 2 months ago
Document Analysis Support for the Manual Auditing of Elections
Recent developments have resulted in dramatic changes in the way elections are conducted, both in the United States and around the world. Well-publicized flaws in the security of...
Daniel P. Lopresti, Xiang Zhou, Xiaolei Huang, Gan...
CSFW
2006
IEEE
14 years 1 months ago
Coercion-Resistance and Receipt-Freeness in Electronic Voting
In this paper we formally study important properties of electronic voting protocols. In particular we are interested in coercion-resistance and receipt-freeness. Intuitively, an e...
Stéphanie Delaune, Steve Kremer, Mark Ryan
DSN
2008
IEEE
14 years 1 months ago
A robust and lightweight stable leader election service for dynamic systems
We describe the implementation and experimental evaluation of a fault-tolerant leader election service for dynamic systems. Intuitively, distributed applications can use this serv...
Nicolas Schiper, Sam Toueg