International audienceWe 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
We prove that to find optimal positional strategies for stochastic mean payoff games when the value ...
International audienceWe show that in perfect-information stochastic parity games with a finite stat...
We consider two-player innite games played on graphs. The games are concurrent, in that at each stat...
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 define and examine priority mean-payoff games - a natural extension of pari...
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...
The theory of graph games is the foundation for modeling and synthesizing reactive processes. In the...
The winning condition of a parity game with costs requires an arbitrary, but fixed bound on the cost...
Given a zero-sum infinite game we examine the question if players have optimal memoryless determinis...
We consider two-player zero-sum stochastic games with the limsup and with the liminf payoffs. For th...
This thesis examines some quantitative questions in the framework of two different stochastic models...
International audienceWe consider infinite antagonistic games over finite graphs. We present conditi...
We prove that to find optimal positional strategies for stochastic mean payoff games when the value ...
International audienceWe show that in perfect-information stochastic parity games with a finite stat...
We consider two-player innite games played on graphs. The games are concurrent, in that at each stat...
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 define and examine priority mean-payoff games - a natural extension of pari...
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...
The theory of graph games is the foundation for modeling and synthesizing reactive processes. In the...
The winning condition of a parity game with costs requires an arbitrary, but fixed bound on the cost...
Given a zero-sum infinite game we examine the question if players have optimal memoryless determinis...
We consider two-player zero-sum stochastic games with the limsup and with the liminf payoffs. For th...
This thesis examines some quantitative questions in the framework of two different stochastic models...
International audienceWe consider infinite antagonistic games over finite graphs. We present conditi...
We prove that to find optimal positional strategies for stochastic mean payoff games when the value ...
International audienceWe show that in perfect-information stochastic parity games with a finite stat...
We consider two-player innite games played on graphs. The games are concurrent, in that at each stat...