Follow
Michal Šustr
Michal Šustr
PhD student at AIC FEE, Czech Technical University, Prague
Verified email at aic.fel.cvut.cz - Homepage
Title
Cited by
Cited by
Year
Monte Carlo Continual Resolving for Online Strategy Computation in Imperfect Information Games
M Šustr, V Kovařík, V Lisý
Proceedings of the 18th International Conference on Autonomous Agents and …, 2019
272019
Sound search in imperfect information games
M Šustr, M Schmid, M Moravčík, N Burch, M Lanctot, M Bowling
arXiv preprint arXiv:2006.08740, 2020
72020
Sound Algorithms in Imperfect Information Games
M Šustr, M Schmid, M Moravčík, N Burch, M Lanctot, M Bowling
Proceedings of the 20th International Conference on Autonomous Agents and …, 2021
42021
Multi-platform Version of StarCraft: Brood War in a Docker Container: Technical Report
M Šustr, J Malý, M Čertický
arXiv preprint arXiv:1801.02193, 2018
42018
Particle Value Functions in Imperfect Information Games
M Šustr, V Kovařík, V Lisý
AAMAS Adaptive and Learning Agents Workshop, 2021
32021
Fast Algorithms for Poker Require Modelling it as a Sequential Bayesian Game
V Kovařík, D Milec, M Šustr, D Seitz, V Lisý
arXiv preprint arXiv:2112.10890, 2021
22021
Learning not to Regret
D Sychrovský, M Šustr, E Davoodi, M Bowling, M Lanctot, M Schmid
Proceedings of the AAAI Conference on Artificial Intelligence 38 (14), 15202 …, 2024
2024
Global CFR: Meta-Learning in Self-Play Regret Minimization
D Sychrovský, M Sustr, M Bowling, M Schmid
OPT 2023: Optimization for Machine Learning, 2023
2023
Revisiting Game Representations: The Hidden Costs of Efficiency in Sequential Decision-making Algorithms
V Kovařík, D Milec, M Šustr, D Seitz, V Lisý
arXiv preprint arXiv:2112.10890, 2021
2021
Revisiting Game Representations: The Hidden Costs of Efficiency in Sequential
V Kovařík, D Milec, M Šustr, D Seitz, V Lisý
Available at SSRN 4690803, 0
The system can't perform the operation now. Try again later.
Articles 1–10