Add to ORKGWe examine perfect information stochastic mean-payoff games – a class of games containing as special sub-classes the usual mean-payoff games and parity games. We show that deterministic memoryless strategies that are optimal for discounted games with state-dependent discount factors close to 1 are optimal for priority mean-payoff games establishing a strong link between these two classes.
Abstract We investigate concurrent two-player win/lose stochastic games on finite graphs with prefix...
International audienceReactive systems are often modelled as two person antagonistic games where one...
We present an algorithm to compute the set of perfect public equilibrium payoffs as the discount fac...
We examine perfect information stochastic mean-payoff games – a class of games con-taining as specia...
We examine perfect information stochastic mean-payoff games - a class of games containing as special...
International audienceWe examine perfect information stochastic mean-payoff games - a class of games...
International audienceWe define and examine priority mean-payoff games - a natural extension of pari...
We study the complexity of finding the values and optimal strategies of mean payoff games, a family ...
We prove that to find optimal positional strategies for stochastic mean payoff games when the value ...
International audienceWe introduce stochastic priority games - a new class of perfect information st...
Mean-payoff games are important quantitative models for open reactive systems. They have been widely...
We examine the problem of the existence of optimal deterministic stationary strategiesintwo-players ...
International audienceWe present an algorithm to compute the set of perfect public equilibrium payof...
We present an algorithm to compute the set of perfect public equilibrium payoffs as the discount fac...
We study the complexity of finding the values and optimal strategies of mean payoff games on graphs,...
Abstract We investigate concurrent two-player win/lose stochastic games on finite graphs with prefix...
International audienceReactive systems are often modelled as two person antagonistic games where one...
We present an algorithm to compute the set of perfect public equilibrium payoffs as the discount fac...
We examine perfect information stochastic mean-payoff games – a class of games con-taining as specia...
We examine perfect information stochastic mean-payoff games - a class of games containing as special...
International audienceWe examine perfect information stochastic mean-payoff games - a class of games...
International audienceWe define and examine priority mean-payoff games - a natural extension of pari...
We study the complexity of finding the values and optimal strategies of mean payoff games, a family ...
We prove that to find optimal positional strategies for stochastic mean payoff games when the value ...
International audienceWe introduce stochastic priority games - a new class of perfect information st...
Mean-payoff games are important quantitative models for open reactive systems. They have been widely...
We examine the problem of the existence of optimal deterministic stationary strategiesintwo-players ...
International audienceWe present an algorithm to compute the set of perfect public equilibrium payof...
We present an algorithm to compute the set of perfect public equilibrium payoffs as the discount fac...
We study the complexity of finding the values and optimal strategies of mean payoff games on graphs,...
Abstract We investigate concurrent two-player win/lose stochastic games on finite graphs with prefix...
International audienceReactive systems are often modelled as two person antagonistic games where one...
We present an algorithm to compute the set of perfect public equilibrium payoffs as the discount fac...