Abstract

We study the policy evaluation problem in multi-agent reinforcement learning, modeled by a Markov decision process. In this problem, the agents operate in a common environment under a fixed control policy, working together to discover the value (global discounted accumulative reward) associated with each environmental state. Over a series of time steps, the agents act, get rewarded, update their local estimate of the value function, then communicate with their neighbors. The local update at each agent can be interpreted as a distributed variant of the popular temporal difference learning methods \{\sf TD\}\( (\lambda)\). Our main contribution is to provide a finite-analysis on the performance of this distributed \{\sf TD\}\((\lambda)\) algorithm for both constant and time-varying step sizes. The key idea in our analysis is to use the geometric mixing time \(\tau\) of the underlying Markov chain, that is, although the "noise" in our algorithm is Markovian, its dependence is very weak

Authors

(none)

Tags

  • Multi-Agent

Stats

  • citations18
  • S2 citationsβ€”
  • github stars0
  • HF likes0
  • heat score9.59
  • arxiv keydoan2019finite

Related papers