Showing 1 - 1 of 1
We prove a Folk Theorem for asynchronously repeated games in which the set of players who may not be able to change their actions simultaneously. We impose a condition, the finite periods of inaction (FPI) condition, which requires that the number of periods in which every player has at least...
Persistent link: https://www.econbiz.de/10005333063