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
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...
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...
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...
We describe the implementation and experimental evaluation of a fault-tolerant leader election service for dynamic systems. Intuitively, distributed applications can use this serv...