On the computation of large sets of rewards in ETP-ESP-games with communicating states

Games with endogenous transition probabilities and endogenous stage payoffs (or ETP-ESP-games) are stochastic games in which both the transition probabilities and the payo¤s at any stage are continuous functions of the relative frequencies of all action combinations chosen in the past.
We present methods to compute large sets of jointly-convergent pure-strategy rewards in ETP-ESP-games with communicating states. Such sets are useful in determining feasible rewards in a game. They are also instrumental in obtaining the set of (Nash) equilibrium rewards.