English
Related papers

Related papers: Quantum voting and violation of Arrow's Impossibil…

200 papers

We present a general theory of quantum information processing devices, that can be applied to human decision makers, to atomic multimode registers, or to molecular high-spin registers. Our quantum decision theory is a generalization of the…

Quantum Physics · Physics 2009-11-13 V. I. Yukalov , D. Sornette

In this article, we propose to use the formalism of quantum mechanics to describe and explain the so-called "abnormal" behaviour of agents in certain decision or choice contexts. The basic idea is to postulate that the preferences of these…

Physics and Society · Physics 2024-12-04 Herve Zwirn

The disjunction effect in human decision making is often taken to show that the classical law of total probability is violated, motivating quantum-like models. We re-examine this claim for the Prisoner's Dilemma disjunction effect. Under…

Neurons and Cognition · Quantitative Biology 2026-03-25 Ryo Nasu , Yoshihiro Maruyama

The Gibbard-Satterthwaite theorem states that no unanimous and non-dictatorial voting rule is strategyproof. We revisit voting rules and consider a weaker notion of strategyproofness called not obvious manipulability that was proposed by…

Computer Science and Game Theory · Computer Science 2022-06-15 Haris Aziz , Alexander Lam

The paper concerns the protection of the secrecy of ballots, so that the identity of the voters cannot be matched with their vote. To achieve this we use an entangled quantum state to represent the ballots. Each ballot includes the identity…

Quantum Physics · Physics 2007-05-23 Shahar Dolev , Itamar Pitowsky , Boaz Tamir

Quantum game theory, whatever opinions may be held due to its abstract physical formalism, have already found various applications even outside the orthodox physics domain. In this paper we introduce the concept of a quantum auction, its…

General Finance · Quantitative Finance 2009-11-13 E. W. Piotrowski , J. Sladkowski

The well-known Impossibility Theorem of Arrow asserts that any Generalized Social Welfare Function (GSWF) with at least three alternatives, which satisfies Independence of Irrelevant Alternatives (IIA) and Unanimity and is not a…

Combinatorics · Mathematics 2010-03-23 Nathan Keller

We present a systematic investigation of the quantum games, constructed using a novel repeated game protocol, when played repeatedly ad infinitum. We focus on establishing that such repeated games -- by virtue of inherent quantum-mechanical…

Quantum Physics · Physics 2024-02-27 Archan Mukhopadhyay , Saikat Sur , Tanay Saha , Shubhadeep Sadhukhan , Sagar Chakraborty

The totalitarian principle establishes that `anything not forbidden is compulsory'. The problem of quantum correlations is explaining what selects the set of quantum correlations for a Bell and Kochen-Specker (KS) contextuality scenario.…

Quantum Physics · Physics 2019-09-27 Adán Cabello

The Gibbard-Satterthwaite theorem states that every non-dictatorial election rule among at least three alternatives can be strategically manipulated. We prove a quantitative version of the Gibbard-Satterthwaite theorem: a random…

Combinatorics · Mathematics 2011-05-26 Ehud Friedgut , Gil Kalai , Nathan Keller , Noam Nisan

Quantum game theory is the study of strategic behavior by agents with access to quantum technology. Broadly speaking, this technology can be employed in either of two ways: As part of a randomization device or as part of a communications…

Optimization and Control · Mathematics 2011-10-31 Steven E. Landsburg

An unconditionally secure authority-certified anonymous quantum key distribution scheme using conjugate coding is presented, base on which we construct a quantum election scheme without the help of entanglement state. We show that this…

Quantum Physics · Physics 2015-06-03 Rui-Rui Zhou , Li Yang

By the Gibbard--Satterthwaite theorem, every reasonable voting rule for three or more alternatives is susceptible to manipulation: there exist elections where one or more voters can change the election outcome in their favour by…

Computer Science and Game Theory · Computer Science 2017-07-28 Edith Elkind , Umberto Grandi , Francesca Rossi , Arkadii Slinko

Paper develops axiomatic characterization of the family of majority vote rules in the way alternative to characterization of the majority vote given in paper of Kenneth O. May in the 1952. This, similar but different, axiomatics focuses on…

Computer Science and Game Theory · Computer Science 2018-07-03 Artur Poplawski

We introduce and analyze a quantum analogue of the Law of Excluded Gambling Strategies of Classical Decision Theory by the definition of different kind of quantum casinos. The necessity of keeping into account entaglement (by the way we…

Quantum Physics · Physics 2007-05-23 Gavriel Segre

We designed two rules of binary quantum computed vote: Quantum Logical Veto (QLV) and Quantum Logical Nomination (QLN). The conjunction and disjunction from quantum computational logic are used to define QLV and QLN, respectively. Compared…

Quantum Physics · Physics 2022-02-02 Xin Sun , Feifei He , Daowen Qiu , Piotr Kulicki , Mirek Sopek , Meiyun Guo

Iterated bipartite quantum games are implemented in terms of the discrete-time quantum walk on the line. Our proposal allows for conditional strategies, as two rational agents make a choice from a restricted set of two-qubit unitary…

Quantum Physics · Physics 2008-07-31 G. Abal , R. Donangelo , H. Fort

Of indisputable relevance for non-equilibrium thermodynamics, fluctuations theorems have been generalized to the framework of quantum thermodynamics, with the notion of work playing a key role in such contexts. The typical approach consists…

Quantum Physics · Physics 2023-06-28 Thales Augusto Barbosa Pinto Silva , Renato Moreira Angelo

Bayesian networks and their accompanying graphical models are widely used for prediction and analysis across many disciplines. We will reformulate these in terms of linear maps. This reformulation will suggest a natural extension, which we…

Mathematical Physics · Physics 2015-04-01 Michael Pejic

A quantum algorithm succeeds not because the superposition principle allows 'the computation of all values of a function at once' via 'quantum parallelism,' but rather because the structure of a quantum state space allows new sorts of…

Quantum Physics · Physics 2010-05-17 Jeffrey Bub