default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMatej Moravcik
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[c7]Michal Sustr, Martin Schmid, Matej Moravcík, Neil Burch, Marc Lanctot, Michael Bowling:
Sound Algorithms in Imperfect Information Games. AAMAS 2021: 1674-1676- [i6]Martin Schmid, Matej Moravcik, Neil Burch, Rudolf Kadlec, Joshua Davidson, Kevin Waugh, Nolan Bard, Finbarr Timbers, Marc Lanctot, G. Zacharias Holland, Elnaz Davoodi, Alden Christianson, Michael Bowling:
Player of Games. CoRR abs/2112.03178 (2021) - 2020
- [i5]Michal Sustr, Martin Schmid, Matej Moravcík, Neil Burch, Marc Lanctot, Michael Bowling:
Sound Search in Imperfect Information Games. CoRR abs/2006.08740 (2020)
2010 – 2019
- 2019
- [j1]Neil Burch, Matej Moravcik, Martin Schmid:
Revisiting CFR+ and Alternating Updates. J. Artif. Intell. Res. 64: 429-443 (2019) - [c6]Martin Schmid, Neil Burch, Marc Lanctot, Matej Moravcik, Rudolf Kadlec, Michael Bowling:
Variance Reduction in Monte Carlo Counterfactual Regret Minimization (VR-MCCFR) for Extensive Form Games Using Baselines. AAAI 2019: 2157-2164 - 2018
- [c5]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 - [i4]Martin Schmid, Neil Burch, Marc Lanctot, Matej Moravcik, Rudolf Kadlec, Michael Bowling:
Variance Reduction in Monte Carlo Counterfactual Regret Minimization (VR-MCCFR) for Extensive Form Games using Baselines. CoRR abs/1809.03057 (2018) - [i3]Neil Burch, Matej Moravcik, Martin Schmid:
Revisiting CFR+ and Alternating Updates. CoRR abs/1810.11542 (2018) - 2017
- [c4]Neil Burch, Martin Schmid, Matej Moravcik, Michael Bowling:
AIVAT: A New Variance Reduction Technique for Agent Evaluation in Imperfect Information Games. AAAI Workshops 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) - 2016
- [c3]Matej Moravcik, Martin Schmid, Karel Ha, Milan Hladík, Stephen J. Gaukrodger:
Refining Subgames in Large Imperfect Information Games. AAAI 2016: 572-578 - [i1]Neil Burch, Martin Schmid, Matej Moravcik, Michael H. Bowling:
AIVAT: A New Variance Reduction Technique for Agent Evaluation in Imperfect Information Games. CoRR abs/1612.06915 (2016) - 2015
- [c2]Martin Schmid, Matej Moravcik, Milan Hladík, Stephen J. Gaukrodger:
Automatic Public State Space Abstraction in Imperfect Information Games. AAAI Workshop: Computer Poker and Imperfect Information 2015 - 2014
- [c1]Martin Schmid, Matej Moravcik, Milan Hladík:
Bounding the Support Size in Extensive Form Games with Imperfect Information. AAAI 2014: 784-790
Coauthor Index
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-04-25 05: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:
