Related papers: Duality games and operational duality relations
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.…
In multiplayer games with sequential decision-making, self-interested players form dynamic coalitions to achieve most-preferred temporal goals beyond their individual capabilities. We introduce a novel procedure to synthesize strategies…
This paper studies a stochastic game theoretic approach to security and intrusion detection in communication and computer networks. Specifically, an Attacker and a Defender take part in a two-player game over a network of nodes whose…
Several variations of hat guessing games have been popularly discussed in recreational mathematics. In a typical hat guessing game, after initially coordinating a strategy, each of $n$ players is assigned a hat from a given color set.…
In this letter we show that communication when restricted to a single information carrier (i.e. single particle) and finite speed of propagation is fundamentally limited for classical systems. On the other hand, quantum systems can surpass…
We investigate quantitatively the wave-particle duality in a general Mach-Zehnder interferometer setup with an asymmetric beam splitter. The asymmetric beam splitter introduces additional a priori which-path knowledge, which is different…
We study wave-particle duality by exploring for the first time effects of a quantum object's source. A single photon emitted from a pair of nonlocally entangled two-level atoms is specifically analyzed. Surprisingly, duality is found to be…
Parrondo's paradox indicates a paradoxical situation in which a winning expectation may occur in sequences of losing games. There are many versions of the original Parrondo's games in the literature, but the games are played by two players…
A game in which one player makes unitary transformations of a simple system, and another seeks to confound the resulting state by a randomly chosen action is analyzed carefully. It is shown that the second player can reduce any system to a…
Admissibility has been studied for games of infinite duration with Boolean objectives. We extend here this study to games of infinite duration with quantitative objectives. First, we show that, un- der the assumption that optimal worst-case…
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…
Two-player zero-sum "graph games" are a central model, which proceeds as follows. A token is placed on a vertex of a graph, and the two players move it to produce an infinite "play", which determines the winner or payoff of the game.…
In two-player games on graphs, the players move a token through a graph to produce an infinite path, which determines the winner or payoff of the game. Such games are central in formal verification since they model the interaction between a…
Probabilistic concurrent/distributed strategies have so far not been investigated thoroughly in the context of imperfect information, where the Player has only partial knowledge of the moves made by the Opponent. In a situation where the…
Using methods from the statistical mechanics of disordered systems we analyze the properties of bimatrix games with random payoffs in the limit where the number of pure strategies of each player tends to infinity. We analytically calculate…
We formulate a general theory of wave-particle duality for many-body quantum states, which quantifies how wave- and particle-like properties balance each other. Much as in the well-understood single-particle case, which-way information --…
A new approach to play games quantum mechanically is proposed. We consider two players who perform measurements in an EPR-type setting. The payoff relations are defined as functions of *correlations*, i.e. without reference to classical or…
We demonstrate that a ubiquitous feature of network games, bilateral strategic interactions, is equivalent to having player utilities that are additively separable across opponents. We distinguish two formal notions of bilateral strategic…
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…
Counter reachability games are played by two players on a graph with labelled edges. Each move consists in picking an edge from the current location and adding its label to a counter vector. The objective is to reach a given counter value…