We develop a framework for the analysis of strategic interactions under the constructive preference perspective à la Kahneman and Tversky formalized in the Type Indeterminacy model. The players are modeled as systems subject to measurements and characterized by quantum-like uncertain preferences. The decision nodes are modeled as, possibly non-commuting, operators that measure preferences modulo strategic reasoning. We define a Hilbert space of types spanned by the players' eigentypes representing their potential preferences in different situations. We focus on pure strategy TI games of maximal information where all uncertainty stems from the intrinsic indeterminacy of preferences. We show that preferences evolve in a non-deterministic manner with actions along the play: they are endogenous to the interaction. We propose the notion of cashing-on-the-go to compute a player's utility, and the Type Indeterminate Nash Equilibrium as a solution concept relying on best-replies at the level of the eigentypes. We illustrate an example exhibiting the phenomenon of the manipulation of rivals' preferences.
We develop a framework for the analysis of strategic interactions under the constructive preference perspective à la Kahneman and Tversky formalized in the Type Indeterminacy model. The players are modeled as systems subject to measurements and characterized by quantum-like uncertain preferences. The decision nodes are modeled as, possibly non-commuting, operators that measure preferences modulo strategic reasoning. We define a Hilbert space of types spanned by the players' eigentypes representing their potential preferences in different situations. We focus on pure strategy TI games of maximal information where all uncertainty stems from the intrinsic indeterminacy of preferences. We show that preferences evolve in a non-deterministic manner with actions along the play: they are endogenous to the interaction. We propose the notion of cashing-on-the-go to compute a player's utility, and the Type Indeterminate Nash Equilibrium as a solution concept relying on best-replies at the level of the eigentypes. We illustrate an example exhibiting the phenomenon of the manipulation of rivals' preferences.
We develop a basic framework encoding preference relations on the set of possible strategies in a quantum-like fashion. The Type Indeterminacy model introduces quantum-like uncertainty affecting preferences. The players are viewed as systems subject to measurements. The decision nodes are, possibly non-commuting, operators that measure preferences modulo strategic reasoning. We define a Hilbert space of types and focus on pure strategy TI games of maximal information. Preferences evolve in a non-deterministic manner with actions along the play: they are endogenous to the interaction. We propose the Type Indeterminate Nash Equilibrium as a solution concept relying on best-replies at the level of eigentypes.
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.
Quantum games with incomplete information can be studied within a Bayesian framework. We analyze games quantized within the EWL framework [Eisert, Wilkens, and Lewenstein, Phys Rev. Lett. 83, 3077 (1999)]. We solve for the Nash equilibria of a variety of two-player quantum games and compare the results to the solutions of the corresponding classical games. We then analyze Bayesian games where there is uncertainty about the player types in two-player conflicting interest games. The solutions to the Bayesian games are found to have a phase diagram-like structure where different equilibria exist in different parameter regions, depending both on the amount of uncertainty and the degree of entanglement. We find that in games where a Pareto-optimal solution is not a Nash equilibrium, it is possible for the quantized game to have an advantage over the classical version. In addition, we analyze the behavior of the solutions as the strategy choices approach an unrestricted operation. We find that some games have a continuum of solutions, bounded by the solutions of a simpler restricted game. A deeper understanding of Bayesian quantum game theory could lead to novel quantum applications in a multi-agent setting.
Develop an example with 2 DS mention result for 1 DS and commuting DS from ALMZZ and from measurable systems too. Write in words about cognitive dissonance. Dynamic decision making conceptual and some formal description on one page and end with game with QL-players as a generalization. Make the point in distinction with RUM and conditional preferences. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Strategic foresight often involves navigating deeply uncertain futures through scenario-based reasoning. Traditional methods rely on static narratives or probabilistic models, which fail to capture the dynamic, interacting, and nonexclusive nature of competing futures. This paper introduces a quantum-inspired framework for scenario interaction grounded in the mathematical formalism of superposition, interference, and contextuality. Agents are modeled as epistemic learners who iteratively update their preferences across multiple narrative pathways, which are treated as basis states in a conceptual Hilbert space. The simulation combines reinforcement learning with stochastic imitation, producing emergent distributions that resemble quantum-like collapse under feedback. Central to the model is the emergence of symmetries in the scenario structure and learning dynamics. Agents begin with neutral priors, facing a balanced reward landscape, epistemic and normative symmetry that is gradually broken through adaptive behavior. However, statistical symmetries persist at the ensemble level, as agents maintain partial preferences and oscillate among futures. These layered symmetries reflect both the cognitive realism of foresight practices and the mathematical tractability of quantum-inspired systems. The proposed model bridges strategic foresight, game-theoretic interaction, and quantum cognition, and offers a novel computational lens to study how futures are constructed, selected, and stabilized under uncertainty.
This work concentrates on simultaneous move non-cooperating quantum games. Part of it is evidently not new, but it is included for the sake self consistence, as it is devoted to introduction of the mathematical and physical grounds of the pertinent topics, and the way in which a simple classical game is modified to become a quantum game (a procedure referred to as a quantization of a classical game). The connection between game theory and information science is briefly stressed, and the role of quantum entanglement (that plays a central role in the theory of quantum games), is exposed. Armed with these tools, we investigate some basic concepts like the existence (or absence) of a pure strategy and mixed strategy Nash equilibrium and its relation with the degree of entanglement. The main results of this work are as follows: 1) Construction of a numerical algorithm based on the method of best response functions, designed to search for pure strategy Nash equilibrium in quantum games. The formalism is based on the discretization of a continuous variable into a mesh of points, and can be applied to quantum games that are built upon two-players two-strategies classical games, based on the method of best response functions. 2) Application of this algorithm to study the question of how the existence of pure strategy Nash equilibrium is related to the degree of entanglement (specified by a continuous parameter γ ). It is shown that when the classical game GC has a pure strategy Nash equilibrium that is not Pareto efficient, then the quantum game GQ with maximal entanglement (γ = π/2) has no pure strategy Nash equilibrium. By studying a non-symmetric prisoner dilemma game, it is found that there is a critical value 0γc such that for γγc there is a pure strategy Nash equilibrium and for γ≥γc there is no pure strategy Nash equilibrium. The behavior of the two payoffs as function of γ starts at that of the classical ones at (D, D) and approaches the cooperative classical ones at (C, C) (C = confess, D = don’t confess). 3) We then study Bayesian quantum games and show that under certain conditions, there is a pure strategy Nash equilibrium in such games even when entanglement is maximal. 4) We define the basic ingredients of a quantum game based on a two-player three strategies classical game. This requires the introduction of trits (instead of bits) and quantum trits (instead of quantum bits). It is proved that in this quantum game, there is no classical commensurability in the sense that the classical strategies are not obtained as a special case of the quantum strategies.