Difference between revisions of "Michael Bowling"

From Chessprogramming wiki
Jump to: navigation, search
Line 21: Line 21:
 
* [[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]], [[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]], [[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]], [[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=

Revision as of 09:00, 17 April 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].

Selected Publications

[6]

2000 ...

2010 ...

2020 ...

External Links

References

Up one Level