activity
20202026
most citedLower bound on the size of a quasirandom forcing set of permutations

7 citations · 8 across the 4 of their papers we have counts for

collaborators
Showing 2024 · cs.AIShow all

1 paper · 2 filters

cs.AI2024

Threshold UCT: Cost-Constrained Monte Carlo Tree Search with Pareto Curves

Martin Kurečka, Václav Nevyhoštěný, Petr Novotný +1

Constrained Markov decision processes (CMDPs), in which the agent optimizes expected payoffs while keeping the expected cost below a given threshold, are the leading framework for…