Abstract

Subgame consistency is a fundamental element in the solution of cooperative stochastic differential games. In particular, it ensures that the extension of the solution policy to a later starting time and any possible state brought about by prior optimal behavior of the players will remain optimal. Recently, mechanisms for the derivation of subgame consistent solutions in stochastic cooperative differential games with transferable payoffs have been found. In the case when players’ payoffs are nontransferable, the derivation of solution candidates is extremely complicated and often intractable. In this chapter, subgame consistent solutions are derived for a class of cooperative stochastic differential games with nontransferable payoffs.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call