We consider an example of a Markov game with lack of information on one side, that was .rst introduced by Renault (2002). We compute both the value and optimal strategies for a range of parameter values.

We provide a model to study the effect of improving the quality of the filters that users use, and the increase of the cost of mailing spam messages, on the total number of messages that spammers send. We show that increasing the cost of mailing spam messages have the unequivocal effect of...

We study the existence of correlated equilibrium payoff in stochastic games. The correlation devices that we use are either autonomous (they base their choice of signal on previous signals, but not on previous states or actions) or stationary (their choice is independent of any data, and is...

Quitting games are sequential games in which, at any stage, each player has the choice between continuing and quitting. The game ends as soon as at least player chooses to quit; player i then receives a payoff r, which depends on the set S of players that did choose to quit. If the game never...

"There is no place where espionage is not possible." -Sun Tzu, The Art of War, approximately 500BC We consider extensive form games in which players decide on their strategies before the start of play and can purchase noisy information about their opponents' decisions concerning future response...

We study stopping games in the setup of Neveu. We prove the existence of a uniform value (in a sense defined below), by allowing the players to use randomized strategies. In contrast with previous work, we make no comparison assumption on the payoff processes. Moreover, we prove that the value...

We prove an existence result for games with incomplete information with continuous type spaces under the assumption that players have atomic posteriors. This information structure is an extreme example of the failure of absolute continuity of information, hence our result complements the...

An absorbing game is a repeated game where some of the action combinations are absorbing, in the sense that whenever they are played, there is a positive probability that the game terminates, and the players receive some terminal payoff at every future stage. We prove that every n-player...

Randomization may add beneficial flexibility to the construction of optimal simple decision rules in dynamic environments. A decision maker, restricted to the use of simple rules, may find a stochastic rule that strictly outperforms all deterministic ones. This is true even in highly separable...