Add to ORKGWe introduce the concept of strongly attainable sets of payoffs in two-player repeated games with vector payoffs in continuous time. A set of payoffs is called strongly attainable if player 1 has a strategy guaranteeing, even in the worst case, that the distance between the set and the cumulative payoff shrinks with time to zero. We characterize when any vector is strongly attainable and illustrate the motivation of our study on a multiinventory application
Bertrand et al. [1] (LMCS 2019) describe two-player zero-sum games in which one player tries to achi...
We examine Blackwell approachability in so-called generalized quitting games. These are repeated gam...
Abstract. We study the problem of checking whether a two-player reachability game admits more than a...
We introduce the concept of attainable sets of payoffs in two-player repeated games with vector payo...
We introduce the concept of attainable sets of payoffs in two-player repeated games with vector payo...
We introduce the concept of attainable sets of payoffs in two-player repeated games with vector payo...
We consider concurrent games played by two-players on a finite state graph, where in every round the...
We consider concurrent games played by two-players on a finite state graph, where in every round the...
We consider two player, zero-sum, finite-state concurrent reachability games, played for an infinite...
Abstract. We consider a new type of restriction on strategy sets in repeated games, growing strategy...
AbstractWe consider concurrent two-player games with reachability objectives. In such games, at each...
We consider concurrent games played by two players on a finite-state graph, where in every round the...
International audienceQuantitative games are two-player zero-sum games played on directed weighted g...
International audienceWe study approachability theory in the presence of constraints. Given a repeat...
Bertrand et al. [1] (LMCS 2019) describe two-player zero-sum games in which one player tries to achi...
We examine Blackwell approachability in so-called generalized quitting games. These are repeated gam...
Abstract. We study the problem of checking whether a two-player reachability game admits more than a...
We introduce the concept of attainable sets of payoffs in two-player repeated games with vector payo...
We introduce the concept of attainable sets of payoffs in two-player repeated games with vector payo...
We introduce the concept of attainable sets of payoffs in two-player repeated games with vector payo...
We consider concurrent games played by two-players on a finite state graph, where in every round the...
We consider concurrent games played by two-players on a finite state graph, where in every round the...
We consider two player, zero-sum, finite-state concurrent reachability games, played for an infinite...
Abstract. We consider a new type of restriction on strategy sets in repeated games, growing strategy...
AbstractWe consider concurrent two-player games with reachability objectives. In such games, at each...
We consider concurrent games played by two players on a finite-state graph, where in every round the...
International audienceQuantitative games are two-player zero-sum games played on directed weighted g...
International audienceWe study approachability theory in the presence of constraints. Given a repeat...
Bertrand et al. [1] (LMCS 2019) describe two-player zero-sum games in which one player tries to achi...
We examine Blackwell approachability in so-called generalized quitting games. These are repeated gam...
Abstract. We study the problem of checking whether a two-player reachability game admits more than a...