activity
20132025
most citedConvergence of Monte Carlo Tree Search in Simultaneous Move Games

16 citations · 43 across the 12 of their papers we have counts for

collaborators
Showing 2019Show all

5 papers · 1 filter

cs.AI2019

(When) Is Truth-telling Favored in AI Debate?

Vojtěch Kovařík, Ryan Carey

For some problems, humans may not be able to accurately judge the goodness of AI-proposed solutions. Irving et al. (2018) propose that in such cases, we may use a debate between tw…

cs.GT2019★ 3 cited

Problems with the EFG formalism: a solution attempt using observations

Vojtěch Kovařík, Viliam Lisý

We argue that the extensive-form game (EFG) model isn't powerful enough to express all important aspects of imperfect information games, such as those related to decomposition and…

cs.LG2019★ 11 cited

Approximation capability of neural networks on spaces of probability measures and tree-structured domains

Tomas Pevny, Vojtech Kovarik

This paper extends the proof of density of neural networks in the space of continuous (or even measurable) functions on Euclidean spaces to functions on compact sets of probability…

cs.AI2019

Rethinking Formal Models of Partially Observable Multiagent Decision Making

Vojtěch Kovařík, Martin Schmid, Neil Burch +2

Multiagent decision-making in partially observable environments is usually modelled as either an extensive-form game (EFG) in game theory or a partially observable stochastic game…

cs.AI2019★ 2 cited

Value Functions for Depth-Limited Solving in Zero-Sum Imperfect-Information Games

Vojtěch Kovařík, Dominik Seitz, Viliam Lisý +3

We provide a formal definition of depth-limited games together with an accessible and rigorous explanation of the underlying concepts, both of which were previously missing in impe…