Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Foundations of Physics

Quantum-Like Model for Decision Making Process in Two Players Game: A Non-Kolmogorovian Model

Masanari Asano, Masanori Ohya, Andrei Yu. Khrennikov

Published Apr 12, 2010• 66 citations
Publisher
DOI
10.1007/s10701-010-9454-y

Related papers

Quantum Approach to Game Theory

Ramón Alonso‐Sanz

Emergence, complexity and computation•Jan 1, 2019•1 citation

Quantum Reachability Games

Wuniu Liu, Zhihui Li, Yongming Li

The reachability of quantum games refers to the ability of two players to reach a certain subspace of Hilbert spaces in a quantum game modeled by a newly proposed quantum game process (QGP). We refer to this as quantum reachability games (QRGs). Reachability analysis is crucial in studying the strategic behavior and decision-making processes of players in quantum games, as it aids in devising optimal strategies to achieve desired objectives. In a QRG, players make decisions based on their quantum strategies related to decision epochs, which are represented by quantum operations or quantum measurements. We present an algorithm for evaluating two-player strategies, and investigate the optimal QRG for two players, where the goal of player 1 is to maximize his/her probability of reaching a given target subspace, while player 2 aims to minimize it. We show that any optimal QRG are determined, i.e., both of the two players have the same probability of winning in non-cooperative reachability games. Furthermore, our results also demonstrate that reachability games in the quantum world can be undecidable in certain cases. These findings are significantly distinct from those in the probabilistic or classical scenarios. Finally, we present three case studies, penny flipover, ambushing quantum walk and peer-to-peer scheme game on quantum network, to illustrate the potential applications and implications of QRGs.

IEEE Transactions on Emerging Topics in Computational Intelligence•Jul 3, 2024•10 citations

Numerical Simulation of Asano-Khrennikov-Ohya Quantum-like Decision Making Model

Xingdong Zuo

In classical game theory, the rational behavior for the player is to make the decision which is approaching Nash equilibrium. The Prisoner's Dilemma, which is a canonical game, is often used to present the rationality. In real experiment in cognitive psychology which were performed by Tversky and Shafir, the statistical data show the existence of the irrational behaviors in reality. The phenomenon is called disjunction effect. To explain why it probably happens, we review the Asano-Khrennikov-Ohya model which is the mathematical modeling of the process of decision making in the game of Prisoner's Dilemma. It applies only the mathematical apparatus of quantum mechanics to the decision making process rather than the quantum physical model. In this paper, we present several numerical simulations for the Asano-Khrennikov-Ohya model together with the graphs of the von Neumann entropy for the solutions. By analyzing the simulation results, we explicitly and numerically present the existence of the irrational behavior for the player which is generated by the Asano-Khrennikov-Ohya model.

NeuroQuantology•Nov 21, 2014•1 citation

Quantum game theory

Taksu Cheon

•Jun 1, 2011•0 citations

Do classical (or quantum) transitive preferences always result in indifferent divisions

Marcin Makowski, Edward W. Piotrowski, Jan Sładkowski

The transitivity of preferences is one of the basic assumptions used in the theory of games and decisions. It is often equated with rationality of choice and is considered useful in building rankings. Intransitive preferences are considered paradoxical and undesirable. This problem is discussed by many social and natural sciences. The paper discusses a simple model of sequential game in which two players in each iteration of the game choose one of the two elements. They make their decisions in different contexts defined by the rules of the game. It appears that the optimal strategy of one of the players can only be intransitive! (the so-called \textsl{relevant intransitive strategies}.) On the other hand, the optimal strategy for the second player can be either transitive or intransitive. A quantum model of the game using pure one-qubit strategies is considered. In this model, an increase in importance of intransitive strategies is observed -- there is a certain course of the game where intransitive strategies are the only optimal strategies for both players. The study of decision-making models using quantum information theory tools may shed some new light on the understanding of mechanisms that drive the formation of types of preferences.

arXiv:1501.04063•Dec 30, 2014•0 citations

Quantum-like model of cognitive decision making and information processing

Andrei Yu. Khrennikov

Biosystems•Nov 30, 2008•96 citations
The reachability of quantum games refers to the ability of two players to reach a certain subspace of Hilbert spaces in a quantum game modeled by a newly proposed quantum game process (QGP). We refer to this as quantum reachability games (QRGs). Reachability analysis is crucial in studying the strategic behavior and decision-making processes of players in quantum games, as it aids in devising optimal strategies to achieve desired objectives. In a QRG, players make decisions based on their quantum strategies related to decision epochs, which are represented by quantum operations or quantum measurements. We present an algorithm for evaluating two-player strategies, and investigate the optimal QRG for two players, where the goal of player 1 is to maximize his/her probability of reaching a given target subspace, while player 2 aims to minimize it. We show that any optimal QRG are determined, i.e., both of the two players have the same probability of winning in non-cooperative reachability games. Furthermore, our results also demonstrate that reachability games in the quantum world can be undecidable in certain cases. These findings are significantly distinct from those in the probabilistic or classical scenarios. Finally, we present three case studies, penny flipover, ambushing quantum walk and peer-to-peer scheme game on quantum network, to illustrate the potential applications and implications of QRGs.
In classical game theory, the rational behavior for the player is to make the decision which is approaching Nash equilibrium. The Prisoner's Dilemma, which is a canonical game, is often used to present the rationality. In real experiment in cognitive psychology which were performed by Tversky and Shafir, the statistical data show the existence of the irrational behaviors in reality. The phenomenon is called disjunction effect. To explain why it probably happens, we review the Asano-Khrennikov-Ohya model which is the mathematical modeling of the process of decision making in the game of Prisoner's Dilemma. It applies only the mathematical apparatus of quantum mechanics to the decision making process rather than the quantum physical model. In this paper, we present several numerical simulations for the Asano-Khrennikov-Ohya model together with the graphs of the von Neumann entropy for the solutions. By analyzing the simulation results, we explicitly and numerically present the existence of the irrational behavior for the player which is generated by the Asano-Khrennikov-Ohya model.
The transitivity of preferences is one of the basic assumptions used in the theory of games and decisions. It is often equated with rationality of choice and is considered useful in building rankings. Intransitive preferences are considered paradoxical and undesirable. This problem is discussed by many social and natural sciences. The paper discusses a simple model of sequential game in which two players in each iteration of the game choose one of the two elements. They make their decisions in different contexts defined by the rules of the game. It appears that the optimal strategy of one of the players can only be intransitive! (the so-called \textsl{relevant intransitive strategies}.) On the other hand, the optimal strategy for the second player can be either transitive or intransitive. A quantum model of the game using pure one-qubit strategies is considered. In this model, an increase in importance of intransitive strategies is observed -- there is a certain course of the game where intransitive strategies are the only optimal strategies for both players. The study of decision-making models using quantum information theory tools may shed some new light on the understanding of mechanisms that drive the formation of types of preferences.