25 citations · 66 across the 15 of their papers we have counts for
Showing cs.LOShow all
3 papers · 1 filter
cs.LO2017
The Complexity of Graph-Based Reductions for Reachability in Markov Decision Processes
Stephane Le Roux, Guillermo A. Perez
We study the never-worse relation (NWR) for Markov decision processes with an infinite-horizon reachability objective. A state q is never worse than a state p if the maximal probab…
cs.LO2014
Weihrauch degrees of finding equilibria in sequential games
Stephane Le Roux, Arno Pauly
We consider the degrees of non-computability (Weihrauch degrees) of finding winning strategies (or more generally, Nash equilibria) in infinite sequential games with certain winnin…
cs.LO2014
Equilibria in multi-player multi-outcome infinite sequential games
Stéphane Le Roux, Arno Pauly
We investigate the existence of certain types of equilibria (Nash, -Nash, subgame perfect, -subgame perfect, Pareto-optimal) in multi-player multi-outcome…