An absorbing game is a repeated game where some 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 multi-player absorbing...

This paper discusses the problem regarding the existence of optimal or nearly optimal stationary strategies for a player engaged in a nonleavable stochastic game. It is known that, for these games, player I need not have an -optimal stationary strategy even when the state space of the game is...

We deal with multi-agent Markov decision processes (MDPs) in which cooperation among players is allowed. We find a cooperative payoff distribution procedure (MDP-CPDP) that distributes in the course of the game the payoff that players would earn in the long run game. We show under which...

First we define the splitting operator, which is related to the Shapley operator of the splitting game introduced by Sorin (2002). It depends on two compact convex sets C and D and associates to a function defined on C ×D a saddle function, extending the usual convexification or concavification...

A two-person zero-sum stochastic game with finitely many states and actions is considered. The classical assumption of perfect monitoring is relaxed. Instead of being informed of the previous action of his opponent, each player receives a random signal, the law of which depending on both...

We study finite zero-sum stochastic games in which players do not observe the actions of their opponent. Rather, at each stage, each player observes a stochastic signal that may depend on the current state and on the pair of actions chosen by the players. We assume that each player observes the...

We introduce the dual of a stochastic game with incomplete information on one side, and we deduce some properties of optimal strategies of the uninformed player.