International audienceIn this invited paper, we study the concept of admissible strategies for two player win/lose infinite sequential games with imperfect information. We show that in stark contrast with the perfect information variant, admissible strategies are only guaranteed to exist when players have objectives that are closed sets. As a consequence, we also study decision problems related to the existence of admissible strategies for regular games as well as finite duration games
We consider two-player parity games with imperfect information in which strategies rely on observati...
In this paper we analyze two nested iterative solution procedures for infinite, dynamic games of inc...
Games have been extensively studied, either in computer science, mathematics or even economy. Nevert...
In this invited paper, we study the concept of admissible strategies for two player win/lose infinit...
International audienceIn this invited paper, we study the concept of admissible strategies for two p...
In this invited paper, we study the concept of admissible strategies for two player win/lose infinit...
Admissibility has been studied for games of infinite duration with Boolean objectives. We extend he...
International audienceIn this paper, we study the notion of admissibility for randomised strategies ...
International audienceIn this paper, we study the notion of admissibility in timed games. First, we ...
Abstract We analyse the notion of iterated admissibility, i.e., avoidance of weakly dominated strate...
In this paper, we study the notion of admissibility for randomised strategies in concurrent games. I...
This work adresses the strategy problem for multiplayer games with imperfect information which are o...
Admissible strategies, i.e. those that are not dominated by any other strategy, are a typical ration...
We present a general construction for eliminating imperfect information from games with several play...
Il s'agit d'une resoumission selon les indications données par Franck Laloé.Research report.Games ha...
We consider two-player parity games with imperfect information in which strategies rely on observati...
In this paper we analyze two nested iterative solution procedures for infinite, dynamic games of inc...
Games have been extensively studied, either in computer science, mathematics or even economy. Nevert...
In this invited paper, we study the concept of admissible strategies for two player win/lose infinit...
International audienceIn this invited paper, we study the concept of admissible strategies for two p...
In this invited paper, we study the concept of admissible strategies for two player win/lose infinit...
Admissibility has been studied for games of infinite duration with Boolean objectives. We extend he...
International audienceIn this paper, we study the notion of admissibility for randomised strategies ...
International audienceIn this paper, we study the notion of admissibility in timed games. First, we ...
Abstract We analyse the notion of iterated admissibility, i.e., avoidance of weakly dominated strate...
In this paper, we study the notion of admissibility for randomised strategies in concurrent games. I...
This work adresses the strategy problem for multiplayer games with imperfect information which are o...
Admissible strategies, i.e. those that are not dominated by any other strategy, are a typical ration...
We present a general construction for eliminating imperfect information from games with several play...
Il s'agit d'une resoumission selon les indications données par Franck Laloé.Research report.Games ha...
We consider two-player parity games with imperfect information in which strategies rely on observati...
In this paper we analyze two nested iterative solution procedures for infinite, dynamic games of inc...
Games have been extensively studied, either in computer science, mathematics or even economy. Nevert...