On the Near-Optimality of Local Policies in Large Cooperative Multi-Agent Reinforcement Learning

We show that in a cooperative N-agent network, one can design locally executable policies for the agents such that the resulting discounted sum of average rewards (value) well approximates the optimal value computed over all (including non-local) policies. Specifically, we prove that, if |X|, |U| denote the size of state, and action spaces of individual agents, then for sufficiently small discount factor, the approximation error is given by O(e) where etriangleq frac1√Nleft[√|X|+√|U|right]. Moreover, in a special case where the reward and state transition functions are independent of the action distribution of the population, the error improves to O(e) where etriangleq frac1√N√|X|. Finally, we also devise an algorithm to explicitly construct a local policy. With the help of our approximation results, we further establish that the constructed local policy is within O(maxe,ε) distance of the optimal policy, and the sample complexity to achieve such a local policy is O(ε-3), for any ε>0.