Policy Optimization finds Nash Equilibrium in Regularized General-Sum LQ Games
<|reference_start|>Policy Optimization finds Nash Equilibrium in Regularized General-Sum LQ Games: In this paper, we investigate the impact of introducing relative entropy regularization on the Nash Equilibria (NE) of General-Sum $N$-agent games, revealing the fact that the NE of such games conform to linear Gaussian policies. Moreover, it delineates sufficient conditions, contingent upon the adequacy of entropy regularization, for the uniqueness of the NE within the game. As Policy Optimization serves as a foundational approach for Reinforcement Learning (RL) techniques aimed at finding the NE, in this work we prove the linear convergence of a policy optimization algorithm which (subject to the adequacy of entropy regularization) is capable of provably attaining the NE. Furthermore, in scenarios where the entropy regularization proves insufficient, we present a $\delta$-augmentation technique, which facilitates the achievement of an $\epsilon$-NE within the game.<|reference_end|>
@article{zaman2024policy,
    title={Policy Optimization finds Nash Equilibrium in Regularized General-Sum LQ
  Games},
    author={Muhammad Aneeq uz Zaman, Shubham Aggarwal, Melih Bastopcu, and Tamer
  Bac{s}ar},
    journal={arXiv preprint arXiv:2404.00045},
    year={2024},
    archivePrefix={arXiv},
    eprint={2404.00045},
    primaryClass={cs.GT cs.AI cs.LG cs.MA}
}