Urmăriți
Michael Bowling
Titlu
Citat de
Citat de
Anul
The arcade learning environment: An evaluation platform for general agents
MG Bellemare, Y Naddaf, J Veness, M Bowling
Journal of Artificial Intelligence Research 47, 253-279, 2013
29482013
Multiagent learning using a variable learning rate
M Bowling, M Veloso
Artificial Intelligence 136 (2), 215-250, 2002
10072002
Deepstack: Expert-level artificial intelligence in heads-up no-limit poker
M Moravcík, M Schmid, N Burch, V Lisy, D Morrill, N Bard, T Davis, ...
Science 356 (6337), 508-513, 2017
9792017
Regret minimization in games with incomplete information
M Zinkevich, M Johanson, M Bowling, C Piccione
Advances in Neural Information Processing Systems 20, 1729-1736, 2008
8122008
Heads-up limit hold’em poker is solved
M Bowling, N Burch, M Johanson, O Tammelin
Science 347 (6218), 145-149, 2015
5242015
Revisiting the arcade learning environment: Evaluation protocols and open problems for general agents
MC Machado, MG Bellemare, E Talvitie, J Veness, M Hausknecht, ...
Journal of Artificial Intelligence Research 61, 523-562, 2018
4972018
Rational and convergent learning in stochastic games
M Bowling, M Veloso
International Joint Conference on Artificial Intelligence 17 (1), 1021-1026, 2001
4492001
Automatic gait optimization with gaussian process regression
D Lizotte, T Wang, M Bowling, D Schuurmans
Proc. of IJCAI, 944-949, 2007
3612007
Convergence and no-regret in multiagent learning
M Bowling
Advances in neural information processing systems, 209-216, 2005
3472005
Monte Carlo sampling for regret minimization in extensive games
M Lanctot, K Waugh, M Zinkevich, M Bowling
Advances in Neural Information Processing Systems 22, 1078-1086, 2009
3202009
Bayes’ bluff: Opponent modelling in poker
F Southey, M Bowling, B Larson, C Piccione, N Burch, D Billings, ...
Proceedings of the 21st Annual Conference on Uncertainty in Artificial …, 2005
283*2005
Apprenticeship learning using linear programming
U Syed, M Bowling, RE Schapire
Proceedings of the 25th international conference on Machine learning, 1032-1039, 2008
2792008
The Hanabi challenge: A new frontier for AI research
N Bard, JN Foerster, S Chandar, N Burch, M Lanctot, HF Song, E Parisotto, ...
Artificial Intelligence 280, 103216, 2020
2672020
A laplacian framework for option discovery in reinforcement learning
MC Machado, MG Bellemare, M Bowling
International Conference on Machine Learning, 2295-2304, 2017
2462017
STP: Skills, tactics, and plays for multi-robot control in adversarial environments
B Browning, J Bruce, M Bowling, M Veloso
Proceedings of the Institution of Mechanical Engineers, Part I: Journal of …, 2005
2312005
Dyna-style planning with linear function approximation and prioritized sweeping
RS Sutton, C Szepesvári, A Geramifard, MP Bowling
arXiv preprint arXiv:1206.3285, 2012
2152012
An analysis of stochastic game theory for multiagent reinforcement learning
M Bowling, M Veloso
Carnegie-Mellon Univ Pittsburgh Pa School of Computer Science, 2000
1922000
Solving heads-up limit Texas Hold'em
O Tammelin, N Burch, M Johanson, M Bowling
Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015
1652015
Bayesian sparse sampling for on-line reward optimization
T Wang, D Lizotte, M Bowling, D Schuurmans
Proceedings of the 22nd international conference on Machine learning, 956-963, 2005
1492005
Count-based exploration with the successor representation
MC Machado, MG Bellemare, M Bowling
Proceedings of the AAAI Conference on Artificial Intelligence 34 (04), 5125-5133, 2020
1432020
Sistemul nu poate realiza operația în acest moment. Încercați din nou mai târziu.
Articole 1–20