Add to ORKGAbstract. We study the problem of checking whether a two-player reachability game admits more than a winning strategy. We investigate this in case of perfect and imperfect information, and, by means of an automata approach we provide a linear-time procedure and an exponential-time procedure, respectively. In both cases, the results are tight
In the game-Theoretic approach to reasoning about multi-Agent systems, imperfect information plays a...
This thesis is devoted to a general study of a reachability games on systems with counters. In this ...
This work adresses the strategy problem for multiplayer games with imperfect information which are o...
Abstract. In game theory, deciding whether a designed player wins a game corresponds to check whethe...
We prove two determinacy and decidability results about two-players stochastic reachability games wi...
AbstractWe consider concurrent two-player games with reachability objectives. In such games, at each...
We consider two player, zero-sum, finite-state concurrent reachability games, played for an infinite...
International audienceIn this invited paper, we study the concept of admissible strategies for two p...
Consider concurrent, infinite duration, two-player win/lose games played on graphs. If the winning c...
AbstractWe investigate the use of automata theory to model strategies for nonzero-sum two-person gam...
In two-player finite-state stochastic games of partial obser- vation on graphs, in every state of th...
We consider a class of infinite-state stochastic games generated by stateless pushdown automata (or,...
International audienceWe consider two-person zero-sum stochastic games with signals, a standard mode...
In this paper, we study the problem of deciding the winner of reachability switching games. We study...
AbstractWe consider a class of infinite-state stochastic games generated by stateless pushdown autom...
In the game-Theoretic approach to reasoning about multi-Agent systems, imperfect information plays a...
This thesis is devoted to a general study of a reachability games on systems with counters. In this ...
This work adresses the strategy problem for multiplayer games with imperfect information which are o...
Abstract. In game theory, deciding whether a designed player wins a game corresponds to check whethe...
We prove two determinacy and decidability results about two-players stochastic reachability games wi...
AbstractWe consider concurrent two-player games with reachability objectives. In such games, at each...
We consider two player, zero-sum, finite-state concurrent reachability games, played for an infinite...
International audienceIn this invited paper, we study the concept of admissible strategies for two p...
Consider concurrent, infinite duration, two-player win/lose games played on graphs. If the winning c...
AbstractWe investigate the use of automata theory to model strategies for nonzero-sum two-person gam...
In two-player finite-state stochastic games of partial obser- vation on graphs, in every state of th...
We consider a class of infinite-state stochastic games generated by stateless pushdown automata (or,...
International audienceWe consider two-person zero-sum stochastic games with signals, a standard mode...
In this paper, we study the problem of deciding the winner of reachability switching games. We study...
AbstractWe consider a class of infinite-state stochastic games generated by stateless pushdown autom...
In the game-Theoretic approach to reasoning about multi-Agent systems, imperfect information plays a...
This thesis is devoted to a general study of a reachability games on systems with counters. In this ...
This work adresses the strategy problem for multiplayer games with imperfect information which are o...