Related papers: The Electromagnetic Balance Game: A Probabilistic …
We analyze quantum game with correlated noise through generalized quantization scheme. Four different combinations on the basis of entanglement of initial quantum state and the measurement basis are analyzed. It is shown that the advantage…
Game theory is the mathematical framework for analyzing strategic interactions in conflict and competition situations. In recent years quantum game theory has earned the attention of physicists, and has emerged as a branch of quantum…
The paper studies one-shot two-player games with non-Bayesian uncertainty. The players have an attitude that ranges from optimism to pessimism in the face of uncertainty. Given the attitudes, each player forms a belief about the set of…
We revisit the game in which each of several players chooses a pattern and then a coin is flipped repeatedly until one of these patterns is generated. In particular, we demonstrate how to compute the probability of any one player winning…
Have you ever taken a disputed decision by tossing a coin and checking its landing side? This ancestral "heads or tails" practice is still widely used when facing undecided alternatives since it relies on the intuitive fairness of…
Combinatorial Multi-Armed Bandit with fairness constraints is a framework where multiple arms form a super arm and can be pulled in each round under uncertainty to maximize cumulative rewards while ensuring the minimum average reward…
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…
We introduce a quantum cloning game in which $k$ separate collaborative parties receive a classical input, determining which of them has to share a maximally entangled state with an additional party (referee). We provide the optimal winning…
The numbers game is a one-player game played on a finite simple graph with certain "amplitudes" assigned to its edges and with an initial assignment of real numbers to its nodes. The moves of the game successively transform the numbers at…
We consider 2-player stochastic games with perfectly observed actions, and study the limit, as the discount factor goes to one, of the equilibrium payoffs set. In the usual setup where current states are observed by the players, we show…
This paper considers a game-theoretic formulation of the covert communications problem with finite blocklength, where the transmitter (Alice) can randomly vary her transmit power in different blocks, while the warden (Willie) can randomly…
Here, we present the quantum version of a very famous statistical decision problem, whose classical version is counter-intuitive to many. The Monty Hall game can be phrased as a two person game between Alice and Bob. In their pioneering…
What would you do if you were invited to play a game where you were given \$25 and allowed to place bets for 30 minutes on a coin that you were told was biased to come up heads 60% of the time? This is exactly what we did, gathering 61…
Research in quantum games has flourished during recent years. However, it seems that opinion remains divided about their true quantum character and content. For example, one argument says that quantum games are nothing but 'disguised'…
The last two decades have witnessed a rapid development of quantum information processing, a new paradigm which studies the power and limit of "quantum advantages" in various information processing tasks. Problems such as when quantum…
A query game is a pair of a set $Q$ of queries and a set $\mathcal{F}$ of functions, or codewords $f:Q\rightarrow \mathbb{Z}.$ We think of this as a two-player game. One player, Codemaker, picks a hidden codeword $f\in \mathcal{F}$. The…
This paper introduces a novel criterion, persuasiveness, to select equilibria in signaling games. In response to the Stiglitz critique, persuasiveness focuses on the comparison across equilibria. An equilibrium is more persuasive than an…
We consider infinite duration alternating move games. These games were previously studied by Roth, Balcan, Kalai and Mansour. They presented an FPTAS for computing an approximated equilibrium, and conjectured that there is a polynomial…
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…
We study variants of a stochastic game inspired by backgammon where players may propose to double the stake, with the game state dictated by a one-dimensional random walk. Our variants allow for different numbers of proposals and different…