default search action
Dustin Morrill
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [c9]Dustin Morrill, Thomas J. Walsh, Daniel Hernandez, Peter R. Wurman, Peter Stone:
Composing Efficient, Robust Tests for Policy Selection. UAI 2023: 1456-1466 - [i14]Dustin Morrill, Thomas J. Walsh, Daniel Hernandez, Peter R. Wurman, Peter Stone:
Composing Efficient, Robust Tests for Policy Selection. CoRR abs/2306.07372 (2023) - 2022
- [i13]Dustin Morrill, Esra'a Saleh, Michael Bowling, Amy Greenwald
:
Interpolating Between Softmax Policy Gradient and Neural Replicator Dynamics with Capped Implicit Exploration. CoRR abs/2206.02036 (2022) - 2021
- [c8]Dustin Morrill, Ryan D'Orazio, Reca Sarfati, Marc Lanctot, James R. Wright, Amy R. Greenwald, Michael Bowling:
Hindsight and Sequential Rationality of Correlated Play. AAAI 2021: 5584-5594 - [c7]Dustin Morrill, Ryan D'Orazio, Marc Lanctot, James R. Wright, Michael Bowling, Amy R. Greenwald:
Efficient Deviation Types and Learning for Hindsight Rationality in Extensive-Form Games. ICML 2021: 7818-7828 - [i12]Dustin Morrill, Ryan D'Orazio, Marc Lanctot, James R. Wright, Michael Bowling, Amy Greenwald:
Efficient Deviation Types and Learning for Hindsight Rationality in Extensive-Form Games. CoRR abs/2102.06973 (2021) - [i11]Montaser Mohammedalamen, Dustin Morrill, Alexander Sieusahai, Yash Satsangi, Michael Bowling:
Learning to Be Cautious. CoRR abs/2110.15907 (2021) - [i10]Dustin Morrill, Amy R. Greenwald, Michael Bowling:
The Partially Observable History Process. CoRR abs/2111.08102 (2021) - 2020
- [c6]Ryan D'Orazio, Dustin Morrill, James R. Wright, Michael Bowling:
Alternative Function Approximation Parameterizations for Solving Games: An Analysis of ƒ-Regression Counterfactual Regret Minimization. AAMAS 2020: 339-347 - [c5]Daniel Hennes, Dustin Morrill, Shayegan Omidshafiei, Rémi Munos, Julien Pérolat, Marc Lanctot, Audrunas Gruslys, Jean-Baptiste Lespiau, Paavo Parmas, Edgar A. Duéñez-Guzmán, Karl Tuyls:
Neural Replicator Dynamics: Multiagent Learning via Hedging Policy Gradients. AAMAS 2020: 492-501 - [i9]Audrunas Gruslys, Marc Lanctot, Rémi Munos, Finbarr Timbers, Martin Schmid, Julien Pérolat, Dustin Morrill, Vinícius Flores Zambaldi, Jean-Baptiste Lespiau, John Schultz, Mohammad Gheshlaghi Azar, Michael Bowling, Karl Tuyls:
The Advantage Regret-Matching Actor-Critic. CoRR abs/2008.12234 (2020) - [i8]Dustin Morrill, Ryan D'Orazio, Reca Sarfati, Marc Lanctot, James R. Wright, Amy Greenwald, Michael Bowling:
Hindsight and Sequential Rationality of Correlated Play. CoRR abs/2012.05874 (2020)
2010 – 2019
- 2019
- [c4]Edward Lockhart, Marc Lanctot, Julien Pérolat, Jean-Baptiste Lespiau, Dustin Morrill, Finbarr Timbers, Karl Tuyls:
Computing Approximate Equilibria in Sequential Adversarial Games by Exploitability Descent. IJCAI 2019: 464-470 - [i7]Edward Lockhart, Marc Lanctot, Julien Pérolat, Jean-Baptiste Lespiau, Dustin Morrill, Finbarr Timbers, Karl Tuyls:
Computing Approximate Equilibria in Sequential Adversarial Games by Exploitability Descent. CoRR abs/1903.05614 (2019) - [i6]Shayegan Omidshafiei, Daniel Hennes, Dustin Morrill, Rémi Munos, Julien Pérolat, Marc Lanctot, Audrunas Gruslys, Jean-Baptiste Lespiau, Karl Tuyls:
Neural Replicator Dynamics. CoRR abs/1906.00190 (2019) - [i5]Marc Lanctot, Edward Lockhart, Jean-Baptiste Lespiau, Vinícius Flores Zambaldi, Satyaki Upadhyay, Julien Pérolat, Sriram Srinivasan, Finbarr Timbers, Karl Tuyls, Shayegan Omidshafiei, Daniel Hennes, Dustin Morrill, Paul Muller, Timo Ewalds
OpenSpiel: A Framework for Reinforcement Learning in Games. CoRR abs/1908.09453 (2019) - [i4]Ryan D'Orazio, Dustin Morrill, James R. Wright:
Bounds for Approximate Regret-Matching Algorithms. CoRR abs/1910.01706 (2019) - [i3]Ryan D'Orazio, Dustin Morrill, James R. Wright, Michael Bowling:
Alternative Function Approximation Parameterizations for Solving Games: An Analysis of f-Regression Counterfactual Regret Minimization. CoRR abs/1912.02967 (2019) - 2018
- [c3]Neil Burch, Martin Schmid, Matej Moravcik, Dustin Morrill, Michael Bowling:
AIVAT: A New Variance Reduction Technique for Agent Evaluation in Imperfect Information Games. AAAI 2018: 949-956 - 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
- [c2]Kevin Waugh, Dustin Morrill, James Andrew Bagnell, Michael H. Bowling:
Solving Games with Functional Regret Estimation. AAAI 2015: 2138-2145 - [c1]Kevin Waugh, Dustin Morrill, James Andrew Bagnell, Michael Bowling:
Solving Games with Functional Regret Estimation. AAAI Workshop: Computer Poker and Imperfect Information 2015 - 2014
- [i1]Kevin Waugh, Dustin Morrill, J. Andrew Bagnell, Michael Bowling:
Solving Games with Functional Regret Estimation. CoRR abs/1411.7974 (2014)
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-06-19 21:47 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: