Abstract

In this paper, we consider two-player zero-sum matrix and stochastic games and develop learning dynamics that are payoff-based, convergent, rational, and symmetric between the two players. Specifically, the learning dynamics for matrix games are based on the smoothed best-response dynamics, while the learning dynamics for stochastic games build upon those for matrix games, with additional incorporation of the minimax value iteration. To our knowledge, our theoretical results present the first finite-sample analysis of such learning dynamics with last-iterate guarantees. In the matrix game setting, the results imply a sample complexity of \(O(\epsilon^\{-1\})\) to find the Nash distribution and a sample complexity of \(O(\epsilon^\{-8\})\) to find a Nash equilibrium. In the stochastic game setting, the results also imply a sample complexity of \(O(\epsilon^\{-8\})\) to find a Nash equilibrium. To establish these results, the main challenge is to handle stochastic approximation algorithm

Authors

(none)

Tags

  • Game AI
  • Value-Based

Stats

  • citations0
  • S2 citationsβ€”
  • github stars0
  • HF likes0
  • heat score0.00
  • arxiv keychen2024last

Related papers