Related papers: Model Checking Games for the Quantitative mu-Calcu…
We propose a quantum-like description of markets and economics. The approach has roots in the recently developed quantum game theory.
We compare two different ways of quantization a simple sequential game Cat's Dilemma in the context of the debate on intransitive and transitive preferences. This kind of analysis can have essential meaning for the research on the…
Quantum Decision Theory, advanced earlier by the authors, and illustrated for lotteries with gains, is generalized to the games containing lotteries with gains as well as losses. The mathematical structure of the approach is based on the…
Guarded normal form requires occurrences of fixpoint variables in a {\mu}-calculus-formula to occur under the scope of a modal operator. The literature contains guarded transformations that effectively bring a {\mu}-calculus-formula into…
Relation-changing modal logics are extensions of the basic modal logic that allow changes to the accessibility relation of a model during the evaluation of a formula. In particular, they are equipped with dynamic modalities that are able to…
Playing a symmetric bi-matrix game is usually physically implemented by sharing pairs of 'objects' between two players. A new setting is proposed that explicitly shows effects of quantum correlations between the pairs on the structure of…
In quantum game theory, one of the most intriguing and important questions is, "Is it possible to get quantum advantages without any modification of the classical game?" The answer to this question so far has largely been negative. So far,…
We quantize prisoners dilemma and chicken game by our generalized quantization scheme to explore the role of quantum discord in quantum games. In order to establish this connection we use Werner-like state as an initial state of the game.…
We develop methods to formally describe and compare games, in order to probe questions of game structure and design, and as a stepping stone to predicting player behavior from design patterns. We define a grammar-like formalism to describe…
Building on our previous work on hybrid polyadic modal logic we identify modal logic equivalents for Matching Logic, a logic for program specification and verification. This provides a rigorous way to transfer results between the two…
Probabilistic model checking is a technique for formal automated reasoning about software or hardware systems that operate in the context of uncertainty or stochasticity. It builds upon ideas and techniques from a diverse range of fields,…
Main papers on quantum games are written by physicists for physicists, and the inevitable exploitation of physics jargon may create difficulties for mathematicians or economists. Our goal here is to make clear the physical content and to…
It is shown that quantum logic is a logic in the very same way in which classical logic is a logic. Soundness and completeness of both quantum and classical logics have been proved for novel lattice models that are not orthomodular and…
Dialogue games are a two-player semantics for a variety of logics, including intuitionistic and classical logic. Dialogues can be viewed as a kind of analytic calculus not unlike tableaux. Can dialogue games be an effective foundation for…
Many analysis and verifications tasks, such as static program analyses and model-checking for temporal logics reduce to the solution of systems of equations over suitable lattices. Inspired by recent work on lattice-theoretic progress…
Theory of quantum games is a new area of investigation that has gone through rapid development during the last few years. Initial motivation for playing games, in the quantum world, comes from the possibility of re-formulating quantum…
Repeated quantum game theory addresses long term relations among players who choose quantum strategies. In the conventional quantum game theory, single round quantum games or at most finitely repeated games have been widely studied, however…
The model checking problem for open systems has been intensively studied in the literature, for both finite-state (module checking) and infinite-state (pushdown module checking) systems, with respect to Ctl and Ctl*. In this paper, we…
The double slit experiment provides a clear demarcation between classical and quantum theory, while multi-slit experiments demarcate quantum and higher-order interference theories. In this work we show that these experiments pertain to a…
The polyadic mu-calculus is a modal fixpoint logic whose formulas define relations of nodes rather than just sets in labelled transition systems. It can express exactly the polynomial-time computable and bisimulation-invariant queries on…