Add to ORKGInternational audienceWe define and examine priority mean-payoff games - a natural extension of parity games. By adapting the notion of Blackwell optimality borrowed from the theory of Markov decision processes we show that priority mean-payoff games can be seen as a limit of special multi-discounted games
The winning condition of a parity game with costs requires an arbitrary, but fixed bound on the dist...
International audienceWe consider infinite antagonistic games over finite graphs. We present conditi...
31 pagesIn this paper, we study the set of thresholds that the protagonist can force in a zero-sum t...
International audienceWe define and examine priority mean-payoff games - a natural extension of pari...
International audienceWe examine perfect information stochastic mean-payoff games - a class of games...
We examine perfect information stochastic mean-payoff games – a class of games containing as special...
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 introduce stochastic priority games - a new class of perfect information st...
International audienceMarkov decision processes (MDPs) are controllable discrete event systems with ...
International audienceReactive systems are often modelled as two person antagonistic games where one...
In this paper we survey results of two-player games on graphs and Markov decision processes with par...
This thesis examines some quantitative questions in the framework of two different stochastic models...
The winning condition of a parity game with costs requires an arbitrary, but fixed bound on the cost...
The thesis deals with aspects of the algorithmic complexity of some infinite games, called graph gam...
The winning condition of a parity game with costs requires an arbitrary, but fixed bound on the dist...
International audienceWe consider infinite antagonistic games over finite graphs. We present conditi...
31 pagesIn this paper, we study the set of thresholds that the protagonist can force in a zero-sum t...
International audienceWe define and examine priority mean-payoff games - a natural extension of pari...
International audienceWe examine perfect information stochastic mean-payoff games - a class of games...
We examine perfect information stochastic mean-payoff games – a class of games containing as special...
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 introduce stochastic priority games - a new class of perfect information st...
International audienceMarkov decision processes (MDPs) are controllable discrete event systems with ...
International audienceReactive systems are often modelled as two person antagonistic games where one...
In this paper we survey results of two-player games on graphs and Markov decision processes with par...
This thesis examines some quantitative questions in the framework of two different stochastic models...
The winning condition of a parity game with costs requires an arbitrary, but fixed bound on the cost...
The thesis deals with aspects of the algorithmic complexity of some infinite games, called graph gam...
The winning condition of a parity game with costs requires an arbitrary, but fixed bound on the dist...
International audienceWe consider infinite antagonistic games over finite graphs. We present conditi...
31 pagesIn this paper, we study the set of thresholds that the protagonist can force in a zero-sum t...