相关论文: Quantum Bayesian networks with application to game…

This paper serves as a bridge between quantum computing and analogical modeling (a general theory for predicting categories of behavior in varying contexts). Since its formulation in the early 1980s, analogical modeling has been…

In a series of papers, G. Harmer and D. Abbott study the behavior of random walks associated with games introduced in 1997 by J. M. R. Parrondo. These games illustrate an apparent paradox that random and deterministic mixtures of losing…

The volunteer's dilemma is a well-known game in game theory that models the conflict players face when deciding whether to volunteer for a collective benefit, knowing that volunteering incurs a personal cost. In this work, we introduce a…

Quantum generalizations of conventional games broaden the range of available strategies, which can help improve outcomes for the participants. With many players, such quantum games can involve entanglement among many states which is…

This paper presents a quantum version of the Monty Hall problem based upon the quantum inferring acausal structures, which can be identified with generalization of Bayesian networks. Considered structures are expressed in formalism of…

A new representation of Game Theory is developed in this paper. State of players is represented by a density matrix, and payoff function is a set of hermitian operators, which when applied onto the density matrix give the payoff of players.…

This work contains the mathematical exploration of a few prototypical games in which central concepts from statistics and probability theory naturally emerge. The first two kinds of games are termed Fisher and Bayesian games, which are…

We investigate quantum strategy in moving frames by considering Prisoner's Dilemma and propose four thresholds of $\gamma$ for two players to determine their \textit{Nash Equilibria}. Specially, an interesting phenomenon appears in…

We give a strict mathematical description for a refinement of the Marinatto-Weber quantum game scheme. The model allows the players to choose projector operators that determine the state on which they perform their local operators. The game…

We study a quantum version of the sequential game illustrating problems connected with making rational decisions. We compare the results that the two models (quantum and classical) yield. In the quantum model intransitivity gains importance…

Quantum Bayesian Computation (QBC) is an emerging field that levers the computational gains available from quantum computers to provide an exponential speed-up in Bayesian computation. Our paper adds to the literature in two ways. First, we…

Quantum theory (QT) has been confirmed by numerous experiments, yet we still cannot fully grasp the meaning of the theory. As a consequence, the quantum world appears to us paradoxical. Here we shed new light on QT by having it follow from…

Motivated by non-local games and quantum coloring problems, we introduce a graph homomorphism game between quantum graphs and classical graphs. This game is naturally cast as a "quantum-classical game"--that is, a non-local game of two…

In the present article we consider the conjunction fallacy, a well known cognitive heuristic experimentally tested in cognitive science, which occurs for intuitive judgments in situations of bounded rationality. We show that the quantum…

In this research article, we survey existing quantum physics-related games and, based on this survey, propose a definition for the concept of quantum games. We define a quantum game as any type of rule-based game that either employs the…

After experimenting with a number of non-probabilistic methods for dealing with uncertainty many researchers reaffirm a preference for probability methods [1] [2], although this remains controversial. The importance of being able to form…

This article expands the framework of Bayesian inference and provides direct probabilistic methods for approaching inference tasks that are typically handled with information theory. We treat Bayesian probability updating as a random…

Bayesian networks are a canonical formalism for representing probabilistic dependencies, yet their integration within logic programming frameworks remains a nontrivial challenge, mainly due to the complex structure of these networks. In…

A preparation game is a task whereby a player sequentially sends a number of quantum states to a referee, who probes each of them and announces the measurement result. The measurement setting in each round, as well as the final score of the…

This paper develops and analyses a novel quantum combinatorial game: quantum checkers (codenamed Cheqqers). The concepts of superposition, entanglement, measurements and interference from quantum mechanics are integrated into the game of…