based on a meta-theoretical analysis of voting, the present paper is an attempt to present a theoretical model encompassing all the possible aspects of voting in an election action system, proposing four sub-systems of voting as follows: economic voting, political voting, cultural voting and moral voting. having distinguished among these sub-systems, the writer describes the constitutive elemen...

Internet has found an increasing role in the politics, during the last decade. Today, terms like digital democracy, Internet elections, Internet advertisements (propaganda, social- political Web logging in the internet has become common terms.  Internet is getting replaced for the traditional media in politics. The interactive characteristic of this media has changed it to an unrivaled instrume...

We analyze in detail a leader election protocol that we call the Swedish leader election protocol. The goal is to select one among n > 0 players, by proceeding through a number of rounds. If there is only one player remaining, the protocol stops and the player is declared the leader. Otherwise, all remaining players flip a biased coin; with probability q the player survives to the next round, w...

In this paper we consider the problem of distributed leader election in unoriented Abelian Cayley graphs of degree 4. This family of graphs, denoted by C G 4, include bidimensional tori of arbitrary size and chordal rings with one arbitrary chord. We present an algorithm which assumes that the only structural knowledge available to the nodes is “I am in an Abelian Cayley Graph of degree 4”. The...

Palamidessi has shown that the π-calculus with mixed choice is powerful enough to solve the leader election problem on a symmetric ring of processes. We show that this is also possible in the calculus of Mobile Ambients (MA), without using communication or restriction. Following Palamidessi’s methods, we deduce that there is no encoding satisfying certain conditions from MA into CCS. We also sh...

We address the enumeration and the leader election problems over partially anonymous and multi-hop broadcast networks. We consider an asynchronous communication model where each process broadcasts a message and all its neighbours receive this message after arbitrary and unpredictable time. In this paper, we present necessary conditions that must be satisfied by any graph to solve these problems...