default search action
Vojtech Kovarík
Person information
- unicode name: Vojtěch Kovařík
- affiliation: Czech Technical University in Prague, Department of Computer Science and Engineering
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i14]Vojtech Kovarík, Caspar Oesterheld, Vincent Conitzer:
Recursive Joint Simulation in Games. CoRR abs/2402.08128 (2024) - [i13]Vojtech Kovarík, Christian van Merwijk, Ida Mattsson:
Extinction Risks from AI: Invisible to Science? CoRR abs/2403.05540 (2024) - 2023
- [j4]Vojtech Kovarík
, Dominik Seitz, Viliam Lisý
Value functions for depth-limited solving in zero-sum imperfect-information games. Artif. Intell. 314: 103805 (2023) - [j3]Karel Horák
Solving zero-sum one-sided partially observable stochastic games. Artif. Intell. 316: 103838 (2023) - [c5]Vojtech Kovarík, Caspar Oesterheld, Vincent Conitzer:
Game Theory with Simulation of Other Players. IJCAI 2023: 2800-2807 - [c4]Vojtech Kovarík, Martin Schmid, Neil Burch, Michael Bowling, Viliam Lisý:
Rethinking Formal Models of Partially Observable Multiagent Decision Making (Extended Abstract). IJCAI 2023: 6920-6924 - [i12]Vojtech Kovarík, Caspar Oesterheld, Vincent Conitzer:
Game Theory with Simulation of Other Players. CoRR abs/2305.11261 (2023) - 2022
- [j2]Vojtech Kovarík
Rethinking formal models of partially observable multiagent decision making. Artif. Intell. 303: 103645 (2022) - 2021
- [i11]Vojtech Kovarík, David Milec, Michal Sustr, Dominik Seitz, Viliam Lisý:
Fast Algorithms for Poker Require Modelling it as a Sequential Bayesian Game. CoRR abs/2112.10890 (2021) - 2020
- [j1]Vojtech Kovarík
Analysis of Hannan consistent selection for Monte Carlo tree search in simultaneous move games. Mach. Learn. 109(1): 1-50 (2020) - [c3]Vojtech Kovarík, Ryan Carey:
(When) Is Truth-telling Favored in AI Debate? SafeAI@AAAI 2020: 128-137 - [i10]Karel Horák, Branislav Bosanský, Vojtech Kovarík, Christopher Kiekintveld:
Solving Zero-Sum One-Sided Partially Observable Stochastic Games. CoRR abs/2010.11243 (2020)
2010 – 2019
- 2019
- [c2]Michal Sustr, Vojtech Kovarík, Viliam Lisý:
Monte Carlo Continual Resolving for Online Strategy Computation in Imperfect Information Games. AAMAS 2019: 224-232 - [i9]Tomás Pevný, Vojtech Kovarík:
Approximation capability of neural networks on spaces of probability measures and tree-structured domains. CoRR abs/1906.00764 (2019) - [i8]Vojtech Kovarík, Viliam Lisý:
Problems with the EFG formalism: a solution attempt using observations. CoRR abs/1906.06291 (2019) - [i7]Vojtech Kovarík, Viliam Lisý:
Value Functions for Depth-Limited Solving in Zero-Sum Imperfect-Information Games. CoRR abs/1906.06412 (2019) - [i6]Vojtech Kovarík, Martin Schmid, Neil Burch, Michael Bowling, Viliam Lisý:
Rethinking Formal Models of Partially Observable Multiagent Decision Making. CoRR abs/1906.11110 (2019) - [i5]Vojtech Kovarík, Ryan Carey:
(When) Is Truth-telling Favored in AI Debate? CoRR abs/1911.04266 (2019) - 2018
- [i4]Vojtech Kovarík, Viliam Lisý:
Analysis of Hannan Consistent Selection for Monte Carlo Tree Search in Simultaneous Move Games. CoRR abs/1804.09045 (2018) - [i3]Michal Sustr, Vojtech Kovarík, Viliam Lisý:
Monte Carlo Continual Resolving for Online Strategy Computation in Imperfect Information Games. CoRR abs/1812.07351 (2018) - 2015
- [i2]Vojtech Kovarík, Viliam Lisý:
Analysis of Hannan Consistent Selection for Monte Carlo Tree Search in Simultaneous Move Games. CoRR abs/1509.00149 (2015) - 2013
- [c1]Viliam Lisý, Vojtech Kovarík, Marc Lanctot, Branislav Bosanský:
Convergence of Monte Carlo Tree Search in Simultaneous Move Games. NIPS 2013: 2112-2120 - [i1]Viliam Lisý, Vojtech Kovarík, Marc Lanctot, Branislav Bosanský:
Convergence of Monte Carlo Tree Search in Simultaneous Move Games. CoRR abs/1310.8613 (2013)
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:49 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: