Abstract: In social interaction, the facial expression of an opponent contains information that may influence the In social interaction, the facial expression of an opponent contains information that may influence the interaction. We asked whether facial expression affects decision-making in the ultimatum game. In this two-person game, the proposer divides a sum of money into two parts, one for...

This note addresses scenarios of buyers purchasing rate along paths in a nonhierarchical communication network. A sum bid game is proposed in which each buyer submits a bid, also equal to a payment, and the network allocates rate in a weighted proportionally fair fashion, with the bids as the weights. This is in contrast to an itemized bid game, considered recently by Johari and Tsitsiklis, und...

Game playing is one of the most important areas in AI. Chess is a very popular two-player strategy board game. In the context of AI, chess falls under the category of adversarial games where the opponent tries to reduce your chance of winning as much as possible. Being a classic example of a two-player zero sum game (sum of the utilities of agent and opponent is zero), the game of chess provide...

We study the complexity of solving succinct zero-sum games, i.e., the games whose payoff matrix M is given implicitly by a Boolean circuit C such that M(i, j) = C(i, j). We complement the known EXP-hardness of computing the exact value of a succinct zero-sum game by several results on approximating the value. (1) We prove that approximating the value of a succinct zero-sum game to within an add...

This paper addresses the control of a team of autonomous agents pursuing a smart evader in a nonaccurately mapped terrain. By describing this problem as a partial information Markov game, we are able to integrate map-learning and pursuit. We propose receding horizon control policies, in which the pursuers and the evader try to respectively maximize and minimize the probability of capture at the...

While the idea of a matching pennies game may seem contrived, it is merely the simplest example of a general class of zero-sum games, where the total payoff of the players is constant regardless of the outcome. Consequently gains for one player can only come from losses of the other. For this reason, zero-sum games will rarely have a pure strategy Nash equilibrium. Examples would be chess, or m...

This paper is concerned with a new type of differential game problems of forward-backward stochastic systems. There are three distinguishing features: Firstly, our game systems are forward-backward doubly stochastic differential equations, which is a class of more general game systems than other forward-backward stochastic game systems without doubly stochastic terms; Secondly, forward equation...

A direct sum form is proposed for constructing a composite game from two 2 x 2 games, prisoner's dilemma and snowdrift game. This kind of direct sum form game is called a multiple roles game. The replicator dynamics of the multiple roles game with will-mixed populations is explored. The dynamical behaviors on square lattice are investigated by numerical simulation. It is found that the dynamica...

It is well known that the rock-paper-scissors game has no pure saddle point. We show that this holds more generally: A symmetric two-player zero-sum game has a pure saddle point if and only if it is not a generalized rock-paper-scissors game. Moreover, we show that every finite symmetric quasiconcave two-player zero-sum game has a pure saddle point. Further sufficient conditions for existence a...