Communication complexity of stochastic games
GameNets'09 Proceedings of the First ICST international conference on Game Theory for Networks
Journal of Global Optimization
| Hi-index | 0.00 |
Given a two-person, nonzero-sum stochastic game where the second player controls the transitions, we formulate a linear complementarity problem LCP( q, M) whose solution gives a Nash equilibrium pair of stationary strategies under the limiting average payoff criterion. The matrixM constructed is of the copositive class so that Lemke's algorithm will process it. We will also do the same for a special class ofN-person stochastic games called polymatrix stochastic games.