Arbitrage Pricing of Multi-person Game Contingent Claims

We introduce a class of financial contracts involving several parties by extending the notion of a two-person game option (see Kifer (2000)) to a contract in which an arbitrary number of parties is involved and each of them is allowed to make a wide array of decisions at any time, not restricted to simply `exercising the option'. The collection of decisions by all parties then determines the contract's settlement date as well as the terminal payoff for each party. We provide sufficient conditions under which a multi-person game option has a unique arbitrage price, which is additive with respect to any partition of the contract

Nonzero-sum Stochastic Games

This paper treats of stochastic games. We focus on nonzero-sum games and provide a detailed survey of selected recent results. In Section 1, we consider stochastic Markov games. A correlation of strategies of the players, involving ``public signals'', is described, and a correlated equilibrium theorem proved recently by Nowak and Raghavan for discounted stochastic games with general state space is presented. We also report an extension of this result to a class of undiscounted stochastic games, satisfying some uniform ergodicity condition. Stopping games are related to stochastic Markov games. In Section 2, we describe a version of Dynkin's game related to observation of a Markov process with random assignment mechanism of states to the players. Some recent contributions of the second author in this area are reported. The paper also contains a brief overview of the theory of nonzero-sum stochastic games and stopping games which is very far from being complete.average payoff stochastic games, correlated stationary equilibria, nonzero-sum games, stopping time, stopping games

Optimal stopping and a non-zero-sum Dynkin game in discrete time with risk measures induced by BSDEs

We first study an optimal stopping problem in which a player (an agent) uses a discrete stopping time in order to stop optimally a payoff process whose risk is evaluated by a (non-linear) g-expectation. We then consider a non-zero-sum game on discrete stopping times with two agents who aim at minimizing their respective risks. The payoffs of the agents are assessed by g-expectations (with possibly different drivers for the different players). By using the results of the first part, combined with some ideas of S. Hamadène and J. Zhang, we construct a Nash equilibrium point of this game by a recursive procedure. Our results are obtained in the case of a standard Lipschitz driver g without any additional assumption on the driver besides that ensuring the monotonicity of the corresponding g-expectation