Learning self-play agents for combinatorial optimization problems. (2020)

• Record Type: Journal Article
• Authors: Xu, Ruiyang; Lieberherr, Karl
• Is Part Of: Knowledge engineering review. Volume 35(2020)
• Publication Date: 2020
• Subjects: Expert systems (Computer science) -- Periodicals; 006.33
• DOI: 10.1017/S026988892000020X
• Languages: English
• ISSNs: 0269-8889

Abstract

Abstract: Recent progress in reinforcement learning (RL) using self-play has shown remarkable performance with several board games (e.g., Chess and Go) and video games (e.g., Atari games and Dota2). It is plausible to hypothesize that RL, starting from zero knowledge, might be able to gradually approach a winning strategy after a certain amount of training. In this paper, we explore neural Monte Carlo Tree Search (neural MCTS), an RL algorithm that has been applied successfully by DeepMind to play Go and Chess at a superhuman level. We try to leverage the computational power of neural MCTS to solve a class of combinatorial optimization problems. Following the idea of Hintikka's Game-Theoretical Semantics, we propose the Zermelo Gamification to transform specific combinatorial optimization problems into Zermelo games whose winning strategies correspond to the solutions of the original optimization problems. A specially designed neural MCTS algorithm is then introduced to train Zermelo game agents. We use a prototype problem for which the ground-truth policy is efficiently computable to demonstrate that neural MCTS is promising.