Political Districting Problem is one of the critical issues in political elections, it can be expressed as: how to partition a state into reasonable districts for parliament election and presidential election. In this paper, the political districting problem for parliament election is modelled as a doubly weighted graph partition problem and it is formulated into quadratic programming model. Us...

Leader election is a basic symmetry breaking problem in distributed computing. All nodes of a network have to agree on a single node, called the leader. If the nodes of the network have distinct labels, then agreeing on a single node means that all nodes have to output the label of the elected leader. If the nodes are anonymous, the task of leader election is formulated as follows: every node o...

The 2004 election has been interpreted as a resounding victory for conservative values. Was it in fact a mandate? The present analysis examines recent electoral outcomes and the 2004 election with particular reference to economic and political fundamentals. It compares the results of the 2004 election with predictions using voting models. Additionally, it identifies the trends for different soc...

This thesis presents a study of several combinatorial problems related to social choice and social networks. The main concern is their computational complexity, with an emphasis on their parameterized complexity. The goal is to devise efficient algorithms for each of the problems studied here, or to prove that, under widely-accepted assumptions, such algorithms cannot exist. The problems discus...

How best to predict Australian federal election results? This article analyses three forecasting tools – opinion polls, economic models, and betting odds. Historically, we find that opinion polls taken close to the election are quite accurate, while economic models provide better medium-run forecasts. The 2001 election largely follows this pattern, although the economic models provided more acc...

Web-based on-line voting and on-line election systems provide benefits of usability, manageability and security. A particular workflow in any phase of on-line election process can be modeled and implemented securely by employing basic security applications readily provided by well established cryptographic technologies. By analyzing data-flow between different phases in the workflow, secure pro...

This paper models three stages of the union organizing drive, using a new dataset covering more than 22,000 drives that took place between 1999 and 2004. The correlated sequential model tracks drives through all of their potential stages: holding an election, winning an election, and reaching first contracts. Only one-seventh of organizing drives that filed an election petition with the NLRB ma...

How well do counties answer voters’ questions about upcoming elections? Other studies have reviewed state election department websites [1, 2], but voters vote at the county or town level. How do they get their questions answered? Assuming that one source of election information might be local —the website for the county clerk or registrar—we cataloged 147 county websites, and then conducted a l...

This paper describes the election algorithm that guarantees the reliability of TEMPO, a distributed clock synchronizer running on Berkeley UNIX 7 4.3BSD systems. TEMPO is a distributed program based on a master-slave scheme that is comprised of time daemon processes running on individual machines. The election algorithm chooses a new master from among the slaves after the crash of the machine o...

At Eurocrypt 1993, Park, Itoh, and Kurosawa presented an “all/nothing election scheme and anonymous channel”. The schemes are based on the mix-net and the election scheme constructed from this anonymous channel (Chaum 1981). One of the two main improvements is that the messages sent by normal participants are significantly shorter in the two new anonymous channels. However, we show several succ...