Subgame consistent cooperative solution for NTU dynamic games via variable weights
-
David W.K. Yeung [1] ; Leon A. Petrosyan [1]
-
[1] St Petersburg State University, Russia
-
- Localización: Automatica: A journal of IFAC the International Federation of Automatic Control, ISSN 0005-1098, Vol. 59, 2015, págs. 84-89
- Idioma: inglés
- Texto completo no disponible (Saber más ...)
-
Resumen
In cooperative dynamic games a stringent condition–subgame consistency–is required for a dynamically stable solution. In particular, a cooperative solution is subgame consistent if the optimality principle agreed upon at the outset remains in effect in any subgame starting at a later stage with a state brought about by prior optimal behavior. Hence the players do not have incentives to deviate from the previously adopted optimal behavior. For the first time, subgame consistent solutions in cooperative dynamic games with non-transferable payoffs/utility (NTU) using a variable payoff weights scheme is analyzed. A solution mechanism for characterizing subgame consistent solutions is derived. The use of a variable payoff weights scheme allows the derivation of subgame consistent solutions under a wide range of optimality principles. The analysis widens the application of NTU cooperative dynamic games through the provision of a dynamically stable solution.
