Related papers: Quantum voting and violation of Arrow's Impossibil…
The game in which acts of participants don't have an adequate description in terms of Boolean logic and classical theory of probabilities is considered. The model of the game interaction is constructed on the basis of a non-distributive…
May's Theorem (1952), a celebrated result in social choice, provides the foundation for majority rule. May's crucial assumption of symmetry, often thought of as a procedural equity requirement, is violated by many choice procedures that…
The classic Gibbard-Satterthwaite theorem says that every strategy-proof voting rule with at least three possible candidates must be dictatorial. In \cite{McL11}, McLennan showed that a similar impossibility result holds even if we consider…
Quantum uncertainty is a well-known property of quantum mechanics that states the impossibility of predicting measurement outcomes of multiple incompatible observables simultaneously. In contrast, the uncertainty in the classical domain…
Quantumgametheoryextendsclassical strategic decision-making by incorporating quantum superposition, entanglement, and measurement-induced randomness into competitive interactions. This paper introduces a team-based Quantum Sabotage Game…
Uncovering the origin of the arrow of time remains a fundamental scientific challenge. Within the framework of statistical physics, this problem was inextricably associated with the second law of thermodynamics, which declares that entropy…
The election, a cornerstone of democracy, is one of the best-recognizable symbols of democratic governance. Voters' confidence in elections is essential, and these days, we can watch practically in live broadcast what consequences distrust…
Quantum computing has the potential to solve complex problems faster and more efficiently than classical computing. It can achieve speedups by leveraging quantum phenomena like superposition, entanglement, and tunneling. Quantum walks (QWs)…
Judgment aggregation studies how to combine individual judgments on logically related propositions into a collective judgment. Classical impossibility results show that sufficiently strong logical interconnections force dictatorship under…
This is a brief review of the experimental and theoretical quantum computing. The hopes for eventually building a useful quantum computer rely entirely on the so-called "threshold theorem". In turn, this theorem is based on a number of…
Quantum advantage is notoriously hard to find and even harder to prove. For example the class of functions computable with classical physics actually exactly coincides with the class computable quantum-mechanically. It is strongly believed,…
Understanding the nature of strategic voting is the holy grail of social choice theory, where game-theory, social science and recently computational approaches are all applied in order to model the incentives and behavior of voters. In a…
We develop a systematic approach to quantum probability as a theory of rational betting in quantum gambles. In these games of chance the agent is betting in advance on the outcomes of several (finitely many) incompatible measurements. One…
The Prisoner's Dilemma game (PDG) is one of the simple test-beds for the probabilistic nature of the human decision-making process. Behavioral experiments have been conducted on this game for decades and show a violation of the so-called…
We show that quantum game theory offers solution to the famous Newcomb's paradox (free will problem). Divine foreknowledge is not necessary for successful completion of the game because quantum theory offers a way to discern human…
This paper builds upon the work of Dougherty and Heckelman (2020) by determining the frequency that 13 voting systems violate Arrow's social choice criteria with up to six alternatives. These results determine which of the 13 voting…
The well-known Condorcet's Jury theorem posits that the majority rule selects the best alternative among two available options with probability one, as the population size increases to infinity. We study this result under an asymmetric…
In this paper, we introduce a new model of selection behavior under risk that describes an essential cognitive process for comparing values of objects and making a selection decision. This model is constructed by the quantum-like approach…
We introduce a quantum cloning game in which $k$ separate collaborative parties receive a classical input, determining which of them has to share a maximally entangled state with an additional party (referee). We provide the optimal winning…
A proof of quantumness is a method for provably demonstrating (to a classical verifier) that a quantum device can perform computational tasks that a classical device with comparable resources cannot. Providing a proof of quantumness is the…