Related papers: Analysis of Boolean Functions Related to Binary In…
To date, most efforts to demonstrate quantum nonlocality have concentrated on systems of two (or very few) particles. It is however difficult in many experiments to address individual particles, making it hard to highlight the presence of…
Every simple game is a monotone Boolean function. For the other direction we just have to exclude the two constant functions. The enumeration of monotone Boolean functions with distinguishable variables is also known as the Dedekind's…
This paper unifies the concepts of evolutionary games and quantum strategies. First, we state the formulation and properties of classical evolutionary strategies, with focus on the destinations of evolution in 2-player 2-strategy games. We…
We study a new type of separation between quantum and classical communication complexity which is obtained using quantum protocols where all parties are efficient, in the sense that they can be implemented by small quantum circuits with…
Quantum discord has been utilised in order to find quantum advantage in an extension of the Clauser, Horne, Shimony, and Holt (CHSH) game. By writing the game explicitly as a Bayesian game, the resulting game is modified such the payoff's…
We study the extension of classical games to the quantum domain, generated by the addition of one unitary strategy to two classical strategies of each player. The conditions that need to be met by unitary operations to ensure that the…
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…
This paper studies the rationalization and identification of binary games where players have correlated private types. Allowing for correlation is crucial in global games and in models with social interactions as it represents correlated…
This paper studies game-theoretic decision-making for autonomous vehicles (AVs). A receding horizon multi-player game is formulated to model the AV decision-making problem. Two classes of games, including Nash game and Stackelber games, are…
We consider an application of the mathematical formalism of quantum mechanics (QM) outside physics, namely, to game theory. We present a simple game between macroscopic players, say Alice and Bob (or in a more complex form - Alice, Bob and…
There are increasingly suggestions for computer simulations of quantum statistics which try to violate Bell type inequalities via classical, common cause correlations. The Clauser-Horne-Shimony-Holt (CHSH) inequality is very robust.…
A nonlocality anomaly in which a partially entangled state can outperform a maximally entangled state in a task exploiting nonlocality and several ways to remove the anomaly are discussed. A necessary condition for the anomaly to occur is…
It is known that the generalized Nash equilibrium problem can be reformulated as a quasivariational inequality. Our aim in this work is to introduce a variational approach to study the existence of solutions for generalized ordinal Nash…
Is there an algorithm that takes a game in normal form as input, and outputs a Nash equilibrium? If the payoffs are integers, the answer is yes, and lot of work has been done in its computational complexity. If the payoffs are permitted to…
A quantum algorithm succeeds not because the superposition principle allows 'the computation of all values of a function at once' via 'quantum parallelism,' but rather because the structure of a quantum state space allows new sorts of…
This paper presents a case study for the application of semiring semantics for fixed-point formulae to the analysis of strategies in B\"uchi games. Semiring semantics generalizes the classical Boolean semantics by permitting multiple truth…
We introduce and study a computational version of the principal-agent problem -- a classic problem in Economics that arises when a principal desires to contract an agent to carry out some task, but has incomplete information about the agent…
We introduce a three-player nonlocal game, with a finite number of classical questions and answers, such that the optimal success probability of $1$ in the game can only be achieved in the limit of strategies using arbitrarily…
A Bayesian game is a game of incomplete information in which the rules of the game are not fully known to all players. We consider the Bayesian game of Battle of Sexes that has several Bayesian Nash equilibria and investigate its outcome…
A quantum algorithm for an oracle problem can be understood as a quantum strategy for a player in a two-player zero-sum game in which the other player is constrained to play classically. I formalize this correspondence and give examples of…