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
We define and examine a new class of two-player stochastic games that we call priority games. The pr...
Quantitative extensions of parity games have recently attracted significant interest. These extensio...
[EN] In this paper, we characterize minimax and Pareto-optimal security payoff vectors for general m...
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 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 winning condition of a parity game with costs requires an arbitrary, but fixed bound on the dist...
The thesis deals with aspects of the algorithmic complexity of some infinite games, called graph gam...
We define and examine a new class of two-player stochastic games that we call priority games. The pr...
Quantitative extensions of parity games have recently attracted significant interest. These extensio...
[EN] In this paper, we characterize minimax and Pareto-optimal security payoff vectors for general m...
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 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 winning condition of a parity game with costs requires an arbitrary, but fixed bound on the dist...
The thesis deals with aspects of the algorithmic complexity of some infinite games, called graph gam...
We define and examine a new class of two-player stochastic games that we call priority games. The pr...
Quantitative extensions of parity games have recently attracted significant interest. These extensio...
[EN] In this paper, we characterize minimax and Pareto-optimal security payoff vectors for general m...