activity
20052026
most citedMarkov Decision Processes with Multiple Long-run Average Objectives

47 citations · 144 across the 34 of their papers we have counts for

collaborators
Showing 2013Show all

2 papers · 1 filter

math.LO2013★ 4 cited

Computing K-Trivial Sets by Incomplete Random Sets

Laurent Bienvenu, Adam R. Day, Noam Greenberg +4

Every K-trivial set is computable from an incomplete Martin-Löf random set, i.e., a Martin-Löf random set that does not compute 0'.

eess.SY2013

Trading Performance for Stability in Markov Decision Processes

Tomáš Brázdil, Krishnendu Chatterjee, Vojtěch Forejt +1

We study the complexity of central controller synthesis problems for finite-state Markov decision processes, where the objective is to optimize both the expected mean-payoff perfor…