In contrast to symbolic probkm-solving systems, neural network systems have many salient properties such as parallelism, lear.qability, and fault-tolerance [1,2,5]. But it seems difficult, if not impossible, to construct an expert system in a single gigantic neural network [3,6]. In this paper we introduce a class of structured networks called YEN's (Voting and Election Network.!) in which seve...

In this paper, we propose a blind multisignature scheme based on an extension of the RSA cryptosystem (called the ERSA system). Taking advantage of the scheme, we then present a new multiauthority electronic election system, which can meet all of the following requirements: eligibility, collision free, vigorousness of authorities, accuracy, privacy, verifiability, robustness, fairness, and prev...

Voter mobilization campaigns face trade-offs in fragile democracies. In a large-scale experiment implemented in 2013 with the Kenyan Electoral Commission, text messages intended to mobilize voters boosted participation but also decreased trust in electoral institutions, a decrease that was stronger in areas that experienced election-related violence, and for individuals on the losing side of th...

Leader failure is one of the most fundamental problems in distributed systems. This problem can be solved by Leader Election Algorithms (LEAs). These algorithms move the system from an initial state where all the nodes are in the same computation state into a new state where only one node is distinguished computationally (called leader) and all other nodes aware of this leader. This research ai...

I analyze the effect of a sequential election system when the first voter has private information using a simple two candidate, two voter model in which the second voter is decisive. Both voters observe the candidates’ policy positions, but only the first voter observes which candidate is competent. I show that in equilibrium the candidates pander to the policy preferences of the first voter. D...