Related papers: Quantum voting and violation of Arrow's Impossibil…
Voting is a game with a no-go theorem. New proofs of Arrow's impossibility theorem are given based on quantum information theory. We show that the Arrowian dictator is equivalent to the perfect cloning circuit. We present…
In the realm of algorithmic economics, voting systems are evaluated and compared by examining the properties or axioms they satisfy. While this pursuit has yielded valuable insights, it has also led to seminal impossibility results such as…
Arrow's Impossibility Theorem states that any constitution which satisfies Independence of Irrelevant Alternatives (IIA) and Unanimity and is not a Dictator has to be non-transitive. In this paper we study quantitative versions of Arrow…
Quantum voting, inspired by quantum game theory, provides a framework in which the quantum majority rule (QMR) constitution of Bao and Yunger Halpern [Phys. Rev. A 95, 062306 (2017)] violates the quantum analogue of Arrow's impossibility…
Arrow's Impossibility Theorem is a seminal result of Social Choice Theory that demonstrates the impossibility of ranked-choice decision-making processes to jointly satisfy a number of intuitive and seemingly desirable constraints. The…
Arrow's Theorem concerns a fundamental problem in social choice theory: given the individual preferences of members of a group, how can they be aggregated to form rational group preferences? Arrow showed that in an election between three or…
Arrow's Impossibility Theorem establishes bounds on what we can require from voting systems. Given satisfaction of a small collection of "fairness" axioms, it shows votes can only exist as dictatorships in which one voter determines all…
Arrow's Impossibility Theorem states that any constitution which satisfies Transitivity, Independence of Irrelevant Alternatives (IIA) and Unanimity is a dictatorship. Wilson derived properties of constitutions satisfying Transitivity and…
It is shown that, since an ultrafilter over an operator-algebraically finite (i.e. isomorphic to the lattice of projectors of a finite Von Neumann algebra) quantum logic is not necessarily principal, Arrow's Impossibility Theorem doesn't…
In this paper we study Arrow's Impossibility Theorem in the quantum setting. Our work is based on the work of Bao and Halpern, in which it is proved that the quantum analogue of Arrow's Impossibility Theorem is not valid. However, we feel…
Quantum voting protocols aim to offer ballot secrecy and publicly verifiable tallies using physical guarantees from quantum mechanics, rather than relying solely on computational hardness. This article surveys whether such quantum voting…
Arrow's `impossibility' theorem asserts that there are no satisfactory methods of aggregating individual preferences into collective preferences in many complex situations. This result has ramifications in economics, politics, i.e., the…
In a world where elections touch every aspect of society, the need for secure voting is paramount. Traditional safeguards, based on classical cryptography, rely on complex math problems like factoring large numbers. However, quantum…
Ensuring security and integrity of elections constitutes an important challenge with wide-ranging societal implications. Classically, security guarantees can be ensured based on computational complexity, which may be challenged by quantum…
Electronic voting is a very useful but challenging internet-based protocol that despite many theoretical approaches and various implementations with different degrees of success, remains a contentious topic due to issues in reliability and…
Quantum game theory is a recently developing field of physical research. In this paper, we investigate quantum games in a systematic way. With the famous instance of the Prisoner's Dilemma, we present the fascinating properties of quantum…
Divided Government is nowadays a common feature of the U.S. political system. The voters can cast partisan ballots for two political powers the executive (Presidential elections) and the legislative (the Congress election). Some recent…
We describe quantum protocols for voting and surveying. A key feature of our schemes is the use of entangled states to ensure that the votes are anonymous and to allow the votes to be tallied. The entanglement is distributed over separated…
Let X be a finite set of alternatives. A choice function c is a mapping which assigns to nonempty subsets S of X an element c(S) of S. A rational choice function is one for which there is a linear ordering on the alternatives such that c(S)…
We compare different actual forms of democracy and analyse in which way they are variations of a 'natural consensus decision process'. We analyse how 'consensus decision followed by majority voting' is open to 'false play' by the majority,…