Communication complexity of stochastic games

We derive upper and lower bounds on the communication complexity of determining the existence of pure strategy Nash equilibria for some classes of stochastic games. We prove that pure equilibria of single controller stochastic games and those of SER-SIT (Separable Reward - State Independent Transition) games correspond to those of bimatrix games that are constructed from these stochastic games. Hence we extend communication complexity upper bounds of bimatrix games to these stochastic games. For SER-SIT games, we prove an upper bound of O(n2) which is tight and which coincides with that for bimatrix games. Here n is the number of actions of each player in each state. Note that this bound is independent of the size of the actual payoffs. For single-controller games, we obtain an upper bound of min (O(n2|S|), O(|S| n2 log M)) where S is the set of states and M is the largest entry across all payoff matrices. Further, we reduce bimatrix games to stochastic games and hence, the lower bound extends from bimatrix games to stochastic games as well. We also establish the following results while proving upper bounds for SER-SIT games. To prove that pure equilibria of SER-SIT games correspond to those of auxiliary bimatrix games, we show that every SER-SIT game that has a pure equilibrium has a state-independent pure equilibrium too. We also show that we cannot relax the constraints of separable rewards or state independent transitions. We provide counter examples when the game is SER (but not SIT) and SIT (but not SER).