Related papers: Playing through a noisy channel (and knowing it)

The paper presents a hierarchical Bayesian model for simultaneous inference of tournament graphs and informant error. From multiple informant reports or measurement instrument outputs, the model estimates the structure of a criterion (i.e.,…

In this paper, we propose a Quantum variation of combinatorial games, generalizing the Quantum Tic-Tac-Toe proposed by Allan Goff. A combinatorial game is a two-player game with no chance and no hidden information, such as Go or Chess. In…

Chaos is popularly associated with its property of sensitivity to initial conditions. In this paper we will show that there can be a flip side to this property which is quite fascinating and highly useful in many applications. As a result,…

In the inference attacks studied in Quantitative Information Flow (QIF), the attacker typically tries to interfere with the system in the attempt to increase its leakage of secret information. The defender, on the other hand, typically…

This work investigates the fundamental limits of implementing network oblivious transfer via noisy multiple access channels and broadcast channels between honest-but-curious parties when the parties have access to general tripartite…

In many combinatorial games, one can prove that the first player wins under best play using a simple but non-constructive argument called strategy-stealing. This work is about the complexity behind these proofs: how hard is it to actually…

Given a large population of players, each player has three possible choices between option 1 or 2 or no option. The two options are equally favorable and the population has to reach consensus on one of the two options quickly and in a…

A traditional assumption in game theory is that players are opaque to one another---if a player changes strategies, then this change in strategies does not affect the choice of other players' strategies. In many situations this is an…

We study stochastic effects on the lagging anchor dynamics, a reinforcement learning algorithm used to learn successful strategies in iterated games, which is known to converge to Nash points in the absence of noise. The dynamics is…

This work considers coordination and bargaining between two selfish users over a Gaussian interference channel. The usual information theoretic approach assumes full cooperation among users for codebook and rate selection. In the scenario…

We study a Bayesian coordination game where agents receive private information on the game's payoff structure. In addition, agents receive private signals on each other's private information. We show that once agents possess these different…

A new approach for the study of social games and communications is proposed. Games are simulated between cognitive players who build the opponent's internal model and decide their next strategy from predictions based on the model. In this…

We evaluate the mutual information between the input and the output of a two layer network in the case of a noisy and non-linear analogue channel. In the case where the non-linearity is small with respect to the variability in the noise, we…

In a monotonic sequence game, two players alternately choose elements of a sequence from some fixed ordered set. The game ends when the resulting sequence contains either an ascending subsequence of length a or a descending one of length d.…

Cooperation between nodes sharing a wireless channel is becoming increasingly necessary to achieve performance goals in a wireless network. The problem of determining the feasibility and stability of cooperation between rational nodes in a…

This paper studies a game in which an informed sender with state-independent preferences uses verifiable messages to convince a receiver to choose an action from a finite set. We characterize the equilibrium outcomes of the game and compare…

In secure communications networks there are a great number of user behavioural problems, which need to be dealt with. Curious players pose a very real and serious threat to the integrity of such a network. By traversing a network a Curious…

This paper proposes a new approach to power in Game Theory. Cooperation and conflict are simulated with a mechanism of payoff alteration, called F-game. Using convex combinations of preferences, an F-game can measure players' attitude to…

This note explains why a large class of fair, or reversible "money games", i.e., stochastic models of wealth redistribution among agents, lead to steady states described by canonical and microcanonical distributions. The games considered…

We consider preference communication in two-player multi-objective normal-form games. In such games, the payoffs resulting from joint actions are vector-valued. Taking a utility-based approach, we assume there exists a utility function for…