33 citations · 49 across the 9 of their papers we have counts for
3 papers · 1 filter
Improved bound on the worst case complexity of Policy Iteration
Romain Hollanders, Balázs Gerencsér, Jean-Charles Delvenne +1
Solving Markov Decision Processes (MDPs) is a recurrent task in engineering. Even though it is known that solutions for minimizing the infinite horizon expected reward can be found…
A complexity analysis of Policy Iteration through combinatorial matrices arising from Unique Sink Orientations
Romain Hollanders, Balázs Gerencsér, Jean-Charles Delvenne +1
Unique Sink Orientations (USOs) are an appealing abstraction of several major optimization problems of applied mathematics such as for instance Linear Programming (LP), Markov Deci…
Optimal one-dimensional coverage by unreliable sensors
Paolo Frasca, Federica Garin, Balazs Gerencser +1
This paper regards the problem of optimally placing unreliable sensors in a one-dimensional environment. We assume that sensors can fail with a certain probability and we minimize…