MULTISTAGE COOPERATIVE GAMES AND PROBLEM OF TIME CONSISTENCY.

In this paper we consider the problem of time-consistency of the subcore in a multistage TU-cooperative game. We propose necessary and sufficient conditions for the time-consistency of an imputation from the subcore. Based on these conditions, we suggest an algorithm providing time-consistency of a selector of the subcore. Besides, we prove consistency of the subcore with respect to the MDM-reduction. Finally we introduce the notions of reduced game and dynamic consistency for multistage cooperative games. One of the main results of this paper is a theorem stating some properties of dynamic consistency of the subcore selectors. We focus particularly on the conditions of the dynamic consistency of the subcore with respect to the MDM-reduced game. [ABSTRACT FROM AUTHOR]