A Liquid Democracy Enabled Blockchain-Based Electronic Voting System

Developing an electronic voting system that meets the practical needs of administrators has been a difficult task for a long time. Now, blockchain technologies solve this problem by providing a distributed ledger with immutable, encrypted, and secure transactions. Distributed ledger technologies are an interesting technological leap in the field of data innovation, transparency, and trustability. In public blockchain, distributed ledger technology is widely used. The blockchain technology can be used in an almost infinite number of ways to benefit from sharing economies. The purpose of this study is to assess how blockchain may be utilized to build electronic voting systems that can be used as a service. The purpose of electronic voting systems is explained in this article, as are the technological and legal limitations of employing blockchain as a service. Then, using blockchain as a foundation, we propose a new electronic voting system that fixes the flaws we observed. In general, this paper evaluates the capabilities of distributed ledger technologies by depicting a contextual investigation in order to fine-tune the process of political election decisions and employing a blockchain-based application that improves security and lowers the cost of conducting nationwide elections.

The Fluid Mechanics of Liquid Democracy

Liquid democracy is the principle of making collective decisions by letting agents transitively delegate their votes. Despite its significant appeal, it has become apparent that a weakness of liquid democracy is that a small subset of agents may gain massive influence. To address this, we propose to change the current practice by allowing agents to specify multiple delegation options instead of just one. Much like in nature, where—fluid mechanics teaches us—liquid maintains an equal level in connected vessels, we seek to control the flow of votes in a way that balances influence as much as possible. Specifically, we analyze the problem of choosing delegations to approximately minimize the maximum number of votes entrusted to any agent by drawing connections to the literature on confluent flow. We also introduce a random graph model for liquid democracy and use it to demonstrate the benefits of our approach both theoretically and empirically.

Information Aggregation with Delegation of Votes

Recent developments in blockchain technology have made possible greater progress on secure electronic voting, opening the way to better ways of democratic decision making. In this paper we formalise the features of ``liquid democracy'' which allows voters to delegate their votes to other voters, and we explore whether it improves information aggregation as compared to direct voting. We consider a two-alternative setup with truth-seeking voters (informed and uninformed) and partisan ones (leftists and rightists), and we show that delegation improves information aggregation in finite elections. We also propose a mechanism that further improves the information aggregation properties of delegation in private information settings, by guaranteeing that all vote transfers are from uninformed to informed truth-seeking voters. Delegation offers effective ways for truth-seeking uninformed voters to boost the vote-share of the alternative that matches the state of the world in all considered setups and hence deserves policy makers' attention.

Popular branchings and their dual certificates

Let G be a digraph where every node has preferences over its incoming edges. The preferences of a node extend naturally to preferences over branchings, i.e., directed forests; a branching B is popular if B does not lose a head-to-head election (where nodes cast votes) against any branching. Such popular branchings have a natural application in liquid democracy. The popular branching problem is to decide if G admits a popular branching or not. We give a characterization of popular branchings in terms of dual certificates and use this characterization to design an efficient combinatorial algorithm for the popular branching problem. When preferences are weak rankings, we use our characterization to formulate the popular branching polytope in the original space and also show that our algorithm can be modified to compute a branching with least unpopularity margin. When preferences are strict rankings, we show that “approximately popular” branchings always exist.

Unchaining Collective Intelligence for Science, Research, and Technology Development by Blockchain-Boosted Community Participation

Since its launch just over a decade ago by the cryptocurrency Bitcoin, the distributed ledger technology (DLT) blockchain has followed a breathtaking trajectory into manifold application spaces. This study aper analyses how key factors underpinning the success of this ground-breaking “Internet of value” technology, such as staking of collateral (“skin in the game”), competitive crowdsourcing, crowdfunding, and prediction markets, can be applied to substantially innovate the legacy organization of science, research, and technology development (RTD). Here, we elaborate a highly integrative, community-based strategy where a token-based crypto-economy supports finding best possible consensus, trust, and truth by adding unconventional elements known from reputation systems, betting, secondary markets, and social networking. These tokens support the holder’s formalized reputation and are used in liquid-democracy style governance and arbitration within projects or community-driven initiatives. This participatory research model serves as a solid basis for comprehensively leveraging collective intelligence by effectively incentivizing contributions from the crowd, such as intellectual property work, validation, assessment, infrastructure, education, assessment, governance, publication, and promotion of projects. On the analogy of its current blockbusters like peer-to-peer structured decentralized finance (“DeFi”), blockchain technology can seminally enhance the efficiency of science and RTD initiatives, even permitting to fully stage operations as a chiefless decentralized autonomous organization (DAOs).

Political Representation in Liquid Democracy

This article provides an in-depth survey of political representation in Liquid Democracy (LD). More precisely, it refutes two potential criticisms: 1) LD impoverishes the concept of political representation relative to existing representative democracies; 2) LD undermines the centrality of political parties. In answer to (1), the article shows that LD is compatible with a selection model of representation, in which proxies are characterized as gyroscopic representatives, driven by intrinsic motivation and indifferent to sanctions. This claim has far-reaching normative implications for the mandate-independence tradeoff, anti-elitism, and deliberation under LD. With regard to (2), the article examines the function of parties, arguing that, although it puts parties and interest groups on a level playing field, LD does not threaten partisanship, but rather expands the range of potential carriers of partisanship. In addressing these objections, this article demonstrates the democratic credentials of LD, showing that LD is compatible with a high-quality, democratic understanding of representation, which is surrounded by a cluster of thick concepts like commitment, intrinsic motivation, alignment of objectives, sympathy, trust, and dialogue. This turns LD into a powerful instrument for the refurbishment of representation both as a unique mode of political participation and as a practice of self-government.

Liquid Democracy: An Algorithmic Perspective

We study liquid democracy, a collective decision making paradigm that allows voters to transitively delegate their votes, through an algorithmic lens. In our model, there are two alternatives, one correct and one incorrect, and we are interested in the probability that the majority opinion is correct. Our main question is whether there exist delegation mechanisms that are guaranteed to outperform direct voting, in the sense of being always at least as likely, and sometimes more likely, to make a correct decision. Even though we assume that voters can only delegate their votes to better-informed voters, we show that local delegation mechanisms, which only take the local neighborhood of each voter as input (and, arguably, capture the spirit of liquid democracy), cannot provide the foregoing guarantee. By contrast, we design a non-local delegation mechanism that does provably outperform direct voting under mild assumptions about voters.