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… (More)
DOI: 10.1109/GAMENETS.2009.5137427


2 Figures and Tables

Slides referencing similar topics