BRExIt: On Opponent Modelling in Expert Iteration

Daniel Hernandez, Hendrik Baier, Michael Kaisers

Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence

Main Track. Pages 3795-3802.

https://doi.org/10.24963/ijcai.2023/422

PDF BibTeX

Abstract

Finding a best response policy is a central objective in game theory and multi-agent learning, with modern population-based training approaches employing reinforcement learning algorithms as best-response oracles to improve play against candidate opponents (typically previously learnt policies). We propose Best Response Expert Iteration (BRExIt), which accelerates learning in games by incorporating opponent models into the state-of-the-art learning algorithm Expert Iteration (ExIt). BRExIt aims to (1) improve feature shaping in the apprentice, with a policy head predicting opponent policies as an auxiliary task, and (2) bias opponent moves in planning towards the given or learnt opponent model, to generate apprentice targets that better approximate a best response. In an empirical ablation on BRExIt's algorithmic variants against a set of fixed test agents, we provide statistical evidence that BRExIt learns better performing policies than ExIt. Code available at: https://github.com/Danielhp95/on-opponent-modelling-in-expert-iteration-code. Supplementary material available

at https://arxiv.org/abs/2206.00113.

Keywords

  • Machine Learning: ML: Deep reinforcement learning
  • Machine Learning: ML: Reinforcement learning
  • Search: S: Game playing
Welcome Future Conferences AI Journal Division IJCAI Proceedings Travel Grant Program IJCAI Awards