408 citations · 2.6k across the 52 of their papers we have counts for
4 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…
Network entropy and data rates required for networked control
Christoph Kawan, Jean-Charles Delvenne
We consider the problem of making a set of states invariant for a network of controlled systems. We assume that the subsystems, initially uncoupled, must be interconnected through…
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…
Zero forcing number, constrained matchings and strong structural controllability
Maguy Trefois, Jean-Charles Delvenne
The zero forcing number is a graph invariant introduced to study the minimum rank of the graph. In 2008, Aazami proved the NP-hardness of computing the zero forcing number of a sim…