?
A-Subgame Concept and the Solutions Properties for Multistage Games with Vector Payoffs
We deal with multistage multicriteria games in extensive form and employ so-called “A-subgame” concept to examine dynamical properties of some non-cooperative and cooperative solutions. It is proved that if we take into account only the active players at each A-subgame the set of all strong Pareto equilibria is time consistent but does not satisfy dynamical compatibility.
We construct an optimal cooperative trajectory and vector-valued characteristic function using the refined leximin algorithm. To ensure the sustainability of a cooperative agreement we design the A-incremental imputation distribution procedure for the Shapley value which provides a better incentive for cooperation than classical incremental allocation procedure. This specific payment schedule corresponds to the A-subgame concept satisfies time consistency and efficiency condition and implies non-zero current payment to the active player immediately after her move.