@inbook{2f8e218b63aa49c5be1af056235fe00d,
title = "Monte Carlo Tree Search in Simultaneous Move Games with Applications to Goofspiel",
abstract = "Monte carlo tree search (mcts) has become a widely popular sampled-based search algorithm for two-player games with perfect information. When actions are chosen simultaneously, players may need to mix between their strategies. In this paper, we discuss the adaptation of mcts to simultaneous move games. We introduce a new algorithm, online outcome sampling (oos), that approaches a nash equilibrium strategy over time. We compare both head-to-head performance and exploitability of several mcts variants in goofspiel. We show that regret matching and oos perform best and that all variants produce less exploitable strategies than uct.",
author = "Marc Lanctot and Viliam Lis{\'y} and Winands, {Mark H. M.}",
year = "2014",
doi = "10.1007/978-3-319-05428-5_3",
language = "English",
isbn = "978-3-319-05428-5",
series = "Communications in Computer and Information Science",
publisher = "Springer",
pages = "28--43",
booktitle = "Computer Games",
address = "United States",
}