default search action
Michael Johanson
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [i9]Andrew Butcher, Michael Bradley Johanson, Elnaz Davoodi, Dylan J. A. Brenneis, Leslie Acker, Adam S. R. Parker, Adam White, Joseph Modayil, Patrick M. Pilarski:
Pavlovian Signalling with General Value Functions in Agent-Agent Temporal Decision Making. CoRR abs/2201.03709 (2022) - [i8]Patrick M. Pilarski, Andrew Butcher, Elnaz Davoodi, Michael Bradley Johanson, Dylan J. A. Brenneis, Adam S. R. Parker, Leslie Acker, Matthew M. Botvinick, Joseph Modayil, Adam White:
The Frost Hollow Experiments: Pavlovian Signalling as a Path to Coordination and Communication Between Agents. CoRR abs/2203.09498 (2022) - [i7]Michael Bradley Johanson, Edward Hughes, Finbarr Timbers, Joel Z. Leibo:
Emergent Bartering Behaviour in Multi-Agent Reinforcement Learning. CoRR abs/2205.06760 (2022) - [i6]John P. Agapiou, Alexander Sasha Vezhnevets, Edgar A. Duéñez-Guzmán
, Jayd Matyas, Yiran Mao, Peter Sunehag, Raphael Köster, Udari Madhushani, Kavya Kopparapu, Ramona Comanescu, DJ Strouse, Michael Bradley Johanson, Sukhdeep Singh, Julia Haas, Igor Mordatch, Dean Mobbs, Joel Z. Leibo:
Melting Pot 2.0. CoRR abs/2211.13746 (2022) - 2021
- [i5]Dylan J. A. Brenneis, Adam S. R. Parker, Michael Bradley Johanson, Andrew Butcher, Elnaz Davoodi, Leslie Acker, Matthew M. Botvinick, Joseph Modayil, Adam White, Patrick M. Pilarski:
Assessing Human Interaction in Virtual Reality With Continually Learning Prediction Agents Based on Reinforcement Learning Algorithms: A Pilot Study. CoRR abs/2112.07774 (2021) - 2020
- [j4]Yoram Bachrach
Negotiating team formation using deep reinforcement learning. Artif. Intell. 288: 103356 (2020) - [i4]Yoram Bachrach, Richard Everett, Edward Hughes, Angeliki Lazaridou, Joel Z. Leibo, Marc Lanctot, Michael Johanson, Wojciech M. Czarnecki, Thore Graepel:
Negotiating Team Formation Using Deep Reinforcement Learning. CoRR abs/2010.10380 (2020)
2010 – 2019
- 2019
- [i3]Patrick M. Pilarski, Andrew Butcher, Michael Johanson, Matthew M. Botvinick, Andrew Bolt, Adam S. R. Parker:
Learned human-agent decision-making, communication and joint action in a virtual reality environment. CoRR abs/1905.02691 (2019) - 2017
- [j3]Michael Bowling, Neil Burch, Michael Johanson, Oskari Tammelin:
Heads-up limit hold'em poker is solved. Commun. ACM 60(11): 81-88 (2017) - [i2]Matej Moravcík, Martin Schmid, Neil Burch, Viliam Lisý, Dustin Morrill, Nolan Bard, Trevor Davis, Kevin Waugh, Michael Johanson, Michael H. Bowling:
DeepStack: Expert-Level Artificial Intelligence in No-Limit Poker. CoRR abs/1701.01724 (2017) - 2015
- [c15]Oskari Tammelin, Neil Burch, Michael Johanson, Michael Bowling:
Solving Heads-Up Limit Texas Hold'em. IJCAI 2015: 645-652 - 2014
- [c14]Neil Burch, Michael Johanson, Michael Bowling:
Solving Imperfect Information Games Using Decomposition. AAAI 2014: 602-608 - [c13]Nolan Bard, Michael Johanson, Michael H. Bowling:
Asymmetric abstractions for adversarial settings. AAMAS 2014: 501-508 - 2013
- [j2]Vikas Agrawal, Christopher Archibald, Mehul Bhatt
The AAAI-13 Conference Workshops. AI Mag. 34(4): 9- (2013) - [c12]Nolan Bard, Michael Johanson, Neil Burch, Michael Bowling:
Online implicit agent modelling. AAMAS 2013: 255-262 - [c11]Michael Johanson, Neil Burch, Richard Anthony Valenzano, Michael Bowling:
Evaluating state-space abstractions in extensive-form games. AAMAS 2013: 271-278 - [i1]Michael Johanson:
Measuring the Size of Large No-Limit Poker Games. CoRR abs/1302.7008 (2013) - 2012
- [c10]Michael Johanson, Nolan Bard, Neil Burch, Michael Bowling:
Finding Optimal Abstract Strategies in Extensive-Form Games. AAAI 2012: 1371-1379 - [c9]Michael Johanson, Nolan Bard, Marc Lanctot, Richard G. Gibson, Michael Bowling:
Efficient Nash equilibrium approximation through Monte Carlo counterfactual regret minimization. AAMAS 2012: 837-846 - 2011
- [c8]Michael Johanson, Kevin Waugh, Michael H. Bowling, Martin Zinkevich:
Accelerating Best Response Calculation in Large Extensive Games. IJCAI 2011: 258-265
2000 – 2009
- 2009
- [c7]Michael H. Bowling, Nicholas Abou Risk, Nolan Bard, Darse Billings, Neil Burch, Joshua Davidson, John Alexander Hawkin, Robert Holte, Michael Johanson, Morgan Kan, Bryce Paradis, Jonathan Schaeffer, David Schnizlein, Duane Szafron, Kevin Waugh, Martin Zinkevich:
A demonstration of the Polaris poker system. AAMAS (2) 2009: 1391-1392 - [c6]Kevin Waugh, Martin Zinkevich, Michael Johanson, Morgan Kan, David Schnizlein, Michael H. Bowling:
A Practical Use of Imperfect Recall. SARA 2009 - [c5]Michael Johanson, Michael H. Bowling:
Data Biased Robust Counter Strategies. AISTATS 2009: 264-271 - 2008
- [c4]Michael H. Bowling, Michael Johanson, Neil Burch, Duane Szafron:
Strategy evaluation in extensive games with importance sampling. ICML 2008: 72-79 - 2007
- [c3]Michael Johanson, Martin Zinkevich, Michael H. Bowling:
Computing Robust Counter-Strategies. NIPS 2007: 721-728 - [c2]Martin Zinkevich, Michael Johanson, Michael H. Bowling, Carmelo Piccione:
Regret Minimization in Games with Incomplete Information. NIPS 2007: 1729-1736 - 2005
- [j1]Ryan Hayward, Yngvi Björnsson, Michael Johanson, Morgan Kan, Nathan Po, Jack van Rijswijck:
Solving 7x7 Hex with domination, fill-in, and virtual connections. Theor. Comput. Sci. 349(2): 123-139 (2005) - 2003
- [c1]Ryan Hayward, Yngvi Björnsson, Michael Johanson, Morgan Kan, Nathan Po, Jack van Rijswijck:
Solving 7x7 Hex: Virtual Connections and Game-State Reduction. ACG 2003: 261-278
Coauthor Index
aka: Michael Bowling
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-21 02:40 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: