mlanctot.info - Marc Lanctot's Web Site

Example domain paragraphs

I am a research scientist at DeepMind . Previously, I was a post-doctoral researcher at the Maastricht University Games and AI Group , working with Mark Winands . During my PhD, I worked at University of Alberta with Michael Bowling on sampling algorithms for equilibrium computation and decision-making in games. You can read all about it in my thesis . Before my PhD, I did an undergrad and Master's at McGill University's School of Computer Science and Games Research @ McGill , under the supervision of Clark

This code contains simple examples of a number of CFR algorithms: vanilla CFR, chance-sampled CFR, outcome sampling MCCFR, external sampling MCCFR, public chance sampling, and pure CFR. It also includes an expectimax-based best response algorithm so that the exploitability of the average strategies can be obtained to measure the convergence rate of each algorithm. The algorithms are applied to the game Bluff(1,1), also called Dudo, Perudo, and Liar's Dice . Please read the README.txt contained in the archiv

hexIT is a set of Java classes for representing and displaying a hexagonal board. It has been used to implement hexagonal board games and for course assignments. Publications Journal Articles and Book Chapters Negotiating team formation using deep reinforcement learning . Yoram Bachrach, Richard Everett, Edward Hughes, Angeliki Lazaridou, Joel Z.Leibo, Marc Lanctot, Michael Johanson, Wojciech M.Czarnecki, Thore Graepel. AIJ, 2020. [paper] [arXiv] . The Hanabi challenge: A new frontier for AI research . Nola

mlanctot.info - Marc Lanctot's Web Site

Example domain paragraphs

Links to mlanctot.info (11)