We give a characterization of the equilibrium payoffs of a dynamic game, which is a stochastic game where the transition function is either one or zero and players can only use pure actions in each stage. The characterization is in terms of convex combinations of connected stationary strategies; since stationary strategies are not always connected, the equilibrium set may not be convex. We show that subgame perfection may reduce the equilibrium set.
Download Info
To our knowledge, this item is not available for
download. To find whether it is available, there are three
options:
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page
whether it is in fact available.
3. Perform a search for a similarly titled item that would be
available.