We present an online voting architecture based on partitioning the election in small clusters of voters and using a new Multi-party Computation algorithm for obtaining voting results from the clusters. This new algorithm has some practical advantages over other previously known algorithms and isn’t bound to any specific cryptographic concept; so it can be adapted to future cryptographic exigenc...

In its 1985 election for council The Institute of Management Sciences (TIMS) ran a test of approval voting by sending a non-binding approval ballot to its members along with the regular plurality ballot. In approval voting a person votes for (approves of) as many candidates as desired, the winner being the candidate with the most votes. Two of the TIMS contests had three candidates for a single...

We introduce the notion of a “critical strategy profile” under approval voting (AV), which facilitates the identification of all possible outcomes that can occur under AV. Included among AV outcomes are those given by scoring rules, single transferable vote, the majoritarian compromise, Condorcet systems, and others as well. Under each of these systems, a Condorcet winner may be upset through m...

The adoption of restrictive policies to contain the spread COVID-19 has led many fear authoritarian implications excessive government powers over compliant publics. One strongest responses took place in New Zealand, followed only a few months later by landslide election victory Labour Party, dominant party pre-election coalition. This article tests claim that dispositions were mobilized into an...

The problem of constructing a labeled map of an anonymous and asynchronous network is addressed. We present an algorithm that explores and maps the network by using k identical agents that have no prior knowledge of the network topology. An algorithm of Das, Flocchini, Nayak and Santoro for mapping of the network requires that n and k are co-prime. Our improved algorithm, presented here, requir...

This article investigates the impact of the election of community leaders in local communities (villages or suku) in Timor-Leste. After looking briefly at the impacts of suku elections on selected communities—particularly on community cohesion—and at some community responses to elections, the article discusses local capacities for managing the challenges to social order and cohesion that can fl...

We consider the problem of electing a leader on a ring of nameless processors by de-terministic and self-stabilizing protocols. A processor can read the state of its neighbors (and its own state) to determine if it is enabled. A central demon (scheduler) picks an enabled processor to make an atomic move. In an atomic move, the processor changes to a new state which is a function of its old stat...

I study a model in which high and low income voters must decide between continuing with a status quo policy or switching to a different policy, which is more redistributive. Under the status quo policy, low income voters may get an opportunity to become high income earners. Such opportunities are expected to arise infrequently, so in expectation these voters prefer the more redistributive polic...

Mutual Exclusion is one of the most studied topics in distributed systems where processes communicate by asynchronous message passing. It is often necessary for multiple processes at different sites to access a shared resource or data called a critical section (CS) in distributed systems. A number of algorithms have been proposed to solve the mutual exclusion problem in distributed systems. In ...

We study the problem of designing a distributed voting scheme for electing a candidate that maximizes the preferences of a set of agents. We assume the preference of agent i for candidate j is a real number xi,j , and we do not make any assumptions on the mechanism generating these preferences. We show simple randomized voting schemes guaranteeing the election of a candidate whose expected tota...