Difference between revisions of "Michael Bowling"
GerdIsenberg (talk | contribs) |
GerdIsenberg (talk | contribs) |
||
| (2 intermediate revisions by the same user not shown) | |||
| Line 4: | Line 4: | ||
'''Michael H. Bowling''',<br/> | '''Michael H. Bowling''',<br/> | ||
| − | an American computer scientist and full professor at the [[University of Alberta]] with research focusing on [[Artificial Intelligence|artificial intelligence]], [[Learning|machine learning]], [[Games|games]], and [[Robots|robotics]]. He received his Ph.D. on [https://en.wikipedia.org/wiki/Multi-agent_system multiagent] learning under advisor [[Manuela Veloso]] at [[Carnegie Mellon University]], where he was involved in the [https://en.wikipedia.org/wiki/RoboCup RoboCup] initiative. At UofA, he is leader of the ''Computer Poker Research Group'' <ref>[http://poker.cs.ualberta.ca/ University of Alberta Computer Poker Research Group]</ref>, recently applying [[Deep Learning|deep learning]] to the game of [[Poker]] with the AI agent ''DeepStack'' <ref>[[Matej Moravčík]], [[Martin Schmid]], [[Neil Burch]], [[Viliam Lisý]], [[Dustin Morrill]], [[Nolan Bard]], [[Trevor Davis]], [[Kevin Waugh]], [[Michael Johanson]], [[Michael Bowling]] ('''2017'''). ''[http://science.sciencemag.org/content/356/6337/508 DeepStack: Expert-level artificial intelligence in heads-up no-limit poker]''. [https://en.wikipedia.org/wiki/Science_(journal) Science], Vol. 356, No. 6337</ref> <ref>[https://www.deepstack.ai/ DeepStack]</ref> <ref>[https://github.com/lifrordi/DeepStack-Leduc GitHub - lifrordi/DeepStack-Leduc: Example implementation of the DeepStack algorithm for no-limit Leduc poker]</ref>. | + | an American computer scientist and full professor at the [[University of Alberta]] with research focusing on [[Artificial Intelligence|artificial intelligence]], [[Learning|machine learning]], [[Games|games]], and [[Robots|robotics]]. He received his Ph.D. on [https://en.wikipedia.org/wiki/Multi-agent_system multiagent] learning under advisor [[Manuela Veloso]] at [[Carnegie Mellon University]], where he was involved in the [https://en.wikipedia.org/wiki/RoboCup RoboCup] initiative. At UofA, he is leader of the ''Computer Poker Research Group'' <ref>[http://poker.cs.ualberta.ca/ University of Alberta Computer Poker Research Group]</ref>, recently applying [[Deep Learning|deep learning]] to the game of [[Poker]] with the AI agent ''DeepStack'' <ref>[[Matej Moravčík]], [[Mathematician#MSchmid|Martin Schmid]], [[Neil Burch]], [[Viliam Lisý]], [[Dustin Morrill]], [[Nolan Bard]], [[Trevor Davis]], [[Kevin Waugh]], [[Michael Johanson]], [[Michael Bowling]] ('''2017'''). ''[http://science.sciencemag.org/content/356/6337/508 DeepStack: Expert-level artificial intelligence in heads-up no-limit poker]''. [https://en.wikipedia.org/wiki/Science_(journal) Science], Vol. 356, No. 6337</ref> <ref>[https://www.deepstack.ai/ DeepStack]</ref> <ref>[https://github.com/lifrordi/DeepStack-Leduc GitHub - lifrordi/DeepStack-Leduc: Example implementation of the DeepStack algorithm for no-limit Leduc poker]</ref>. |
=Selected Publications= | =Selected Publications= | ||
| Line 20: | Line 20: | ||
* [[Michael Bowling]], [[Manuela Veloso|Manuela M. Veloso]] ('''2011'''). ''Existence of Multiagent Equilibria with Limited Agents''. [http://www.informatik.uni-trier.de/~ley/db/journals/corr/corr1107.html#abs-1107-0033 CoRR, July 2011] | * [[Michael Bowling]], [[Manuela Veloso|Manuela M. Veloso]] ('''2011'''). ''Existence of Multiagent Equilibria with Limited Agents''. [http://www.informatik.uni-trier.de/~ley/db/journals/corr/corr1107.html#abs-1107-0033 CoRR, July 2011] | ||
* [[Michael Bowling]], [[Neil Burch]], [[Michael Johanson]], [[Oskari Tammelin]] ('''2015'''). ''[http://science.sciencemag.org/content/347/6218/145.full Heads-up limit hold'em poker is solved]''. [https://en.wikipedia.org/wiki/Science_(journal) Science], Vol. 347, No. 6218 | * [[Michael Bowling]], [[Neil Burch]], [[Michael Johanson]], [[Oskari Tammelin]] ('''2015'''). ''[http://science.sciencemag.org/content/347/6218/145.full Heads-up limit hold'em poker is solved]''. [https://en.wikipedia.org/wiki/Science_(journal) Science], Vol. 347, No. 6218 | ||
| − | * [[Matej Moravčík]], [[Martin Schmid]], [[Neil Burch]], [[Viliam Lisý]], [[Dustin Morrill]], [[Nolan Bard]], [[Trevor Davis]], [[Kevin Waugh]], [[Michael Johanson]], [[Michael Bowling]] ('''2017'''). ''[http://science.sciencemag.org/content/356/6337/508 DeepStack: Expert-level artificial intelligence in heads-up no-limit poker]''. [https://en.wikipedia.org/wiki/Science_(journal) Science], Vol. 356, No. 6337 | + | * [[Matej Moravčík]], [[Mathematician#MSchmid|Martin Schmid]], [[Neil Burch]], [[Viliam Lisý]], [[Dustin Morrill]], [[Nolan Bard]], [[Trevor Davis]], [[Kevin Waugh]], [[Michael Johanson]], [[Michael Bowling]] ('''2017'''). ''[http://science.sciencemag.org/content/356/6337/508 DeepStack: Expert-level artificial intelligence in heads-up no-limit poker]''. [https://en.wikipedia.org/wiki/Science_(journal) Science], Vol. 356, No. 6337 |
| + | ==2020 ...== | ||
| + | * [[Finbarr Timbers]], [[Edward Lockhart]], [[Mathematician#MSchmid|Martin Schmid]], [[Marc Lanctot]], [[Michael Bowling]] ('''2020'''). ''Approximate exploitability: Learning a best response in large games''. [https://arxiv.org/abs/2004.09677 arXiv:2004.09677] | ||
| + | * [[Samuel Sokota]], [[Edward Lockhart]], [[Finbarr Timbers]], [[Elnaz Davoodi]], [[Ryan D'Orazio]], [[Neil Burch]], [[Mathematician#MSchmid|Martin Schmid]], [[Michael Bowling]], [[Marc Lanctot]] ('''2021'''). ''Solving Common-Payoff Games with Approximate Policy Iteration''. [https://arxiv.org/abs/2101.04237 arXiv:2101.04237] | ||
=External Links= | =External Links= | ||
| Line 37: | Line 40: | ||
'''[[People|Up one Level]]''' | '''[[People|Up one Level]]''' | ||
[[Category:Researcher|Bowling]] | [[Category:Researcher|Bowling]] | ||
| + | [[Category:Videos|Bowling]] | ||
Latest revision as of 16:19, 30 May 2021
Home * People * Michael Bowling
Michael Bowling [1]
Michael H. Bowling,
an American computer scientist and full professor at the University of Alberta with research focusing on artificial intelligence, machine learning, games, and robotics. He received his Ph.D. on multiagent learning under advisor Manuela Veloso at Carnegie Mellon University, where he was involved in the RoboCup initiative. At UofA, he is leader of the Computer Poker Research Group [2], recently applying deep learning to the game of Poker with the AI agent DeepStack [3] [4] [5].
Contents
Selected Publications
2000 ...
- Michael Bowling, Manuela M. Veloso (2001). Rational and Convergent Learning in Stochastic Games. IJCAI 2001
- Michael Bowling (2003). Multiagent Learning in the Presence of Agents with Limitations. Ph.D. thesis, Carnegie Mellon University, advisor Manuela M. Veloso
- Michael Bowling, Manuela M. Veloso (2003). Simultaneous Adversarial Multi-Robot Learning. IJCAI 2003
- Darse Billings, Aaron Davidson, Terence Schauenberg, Neil Burch, Michael Bowling, Robert Holte, Jonathan Schaeffer, Duane Szafron (2004). Game-Tree Search with Adaptation in Stochastic Imperfect-Information Games. CG 2004
- Michael Bowling, Johannes Fürnkranz, Thore Graepel, Ron Musick (2006). Machine learning and Games. Machine Learning, Vol. 63, No. 3
- Umar Syed, Michael Bowling, Robert Schapire (2008). Apprenticeship learning using linear programming. ICML 2008, pdf
- Maria Cutumisu, Michael Bowling, Duane Szafron, Richard Sutton (2008). Agent Learning using Action-Dependent Learning Rates in Computer Role-Playing Games. Proceedings of the Fourth Artificial Intelligence and Interactive Digital Entertainment Conference, pdf
2010 ...
- Joel Veness, Marc Lanctot, Michael Bowling (2011). Variance Reduction in Monte-Carlo Tree Search. NIPS, pdf
- Michael Bowling, Manuela M. Veloso (2011). Existence of Multiagent Equilibria with Limited Agents. CoRR, July 2011
- Michael Bowling, Neil Burch, Michael Johanson, Oskari Tammelin (2015). Heads-up limit hold'em poker is solved. Science, Vol. 347, No. 6218
- Matej Moravčík, Martin Schmid, Neil Burch, Viliam Lisý, Dustin Morrill, Nolan Bard, Trevor Davis, Kevin Waugh, Michael Johanson, Michael Bowling (2017). DeepStack: Expert-level artificial intelligence in heads-up no-limit poker. Science, Vol. 356, No. 6337
2020 ...
- Finbarr Timbers, Edward Lockhart, Martin Schmid, Marc Lanctot, Michael Bowling (2020). Approximate exploitability: Learning a best response in large games. arXiv:2004.09677
- Samuel Sokota, Edward Lockhart, Finbarr Timbers, Elnaz Davoodi, Ryan D'Orazio, Neil Burch, Martin Schmid, Michael Bowling, Marc Lanctot (2021). Solving Common-Payoff Games with Approximate Policy Iteration. arXiv:2101.04237
External Links
- Michael Bowling's Webpage
- Michael Bowling - Faculty of Science
- Michael Bowling - Department of Computing Science, University of Alberta - VideoLectures.NET
- Michael Bowling - The Mathematics Genealogy Project
- Michael Bowling - Google Scholar Citations
- Michael Bowling – Artificial Intelligence Goes All-In: Computers Playing Poker, March 17, 2017, YouTube Video
- DeepMind expands to Canada with new research office in Edmonton, Alberta by Demis Hassabis, DeepMind, July 5, 2017
References
- ↑ Michael Bowling - Faculty of Science
- ↑ University of Alberta Computer Poker Research Group
- ↑ Matej Moravčík, Martin Schmid, Neil Burch, Viliam Lisý, Dustin Morrill, Nolan Bard, Trevor Davis, Kevin Waugh, Michael Johanson, Michael Bowling (2017). DeepStack: Expert-level artificial intelligence in heads-up no-limit poker. Science, Vol. 356, No. 6337
- ↑ DeepStack
- ↑ GitHub - lifrordi/DeepStack-Leduc: Example implementation of the DeepStack algorithm for no-limit Leduc poker
- ↑ dblp: Michael H. Bowling
