Analysis of Hannan consistent selection for Monte Carlo tree search in simultaneous move games
Sign Up to like & getrecommendations! Published in 2019 at "Machine Learning"
DOI: 10.1007/s10994-019-05832-z
Abstract: Hannan consistency, or no external regret, is a key concept for learning in games. An action selection algorithm is Hannan consistent (HC) if its performance is eventually as good as selecting the best fixed action… read more here.
Keywords: form games; carlo tree; monte carlo; hannan ... See more keywords