We establish that the subgame perfect equilibrium (SPE) threshold problem for mean-payoff games is NP-complete. While the SPE threshold problem was recently shown to be decidable (in doubly exponential time) and NP-hard, its exact worst case complexity was left open
We study the complexity of finding the values and optimal strategies of mean payoff games on graphs,...
31 pagesIn this paper, we study the set of thresholds that the protagonist can force in a zero-sum t...
This paper presents a technique for approximating, up to any precision, the set of subgame-perfect e...
In this paper, we provide an effective characterization of all thesubgame-perfect equilibria in infi...
International audienceWe study the complexity of problems related to subgame-perfect equilibria (SPE...
International audienceIn this paper, we provide an effective characterization of all the subgame-per...
In this paper, we provide an effective characterization of all the subgame-perfect equilibria in inf...
We study the complexity of finding the values and optimal strategies of mean payoff games, a family ...
We study multiplayer turn-based timed games with reachability objectives. In particular, we are inte...
We study multiplayer quantitative reachability games played on a finite directed graph, where the ob...
How to establish the existence of subgame perfect equilibrium (SPE) in bargaining models if no stati...
How long does it take until economic agents converge to an equilibrium? By studying the complexity o...
Today, as computer systems are ubiquitous in our everyday life, there is no need to argue that their...
We study n-player turn-based games played on a finite directed graph. For each play, the players hav...
The concept of subgame perfect -equilibrium (-SPE), where is an error-term, has in recent years emer...
We study the complexity of finding the values and optimal strategies of mean payoff games on graphs,...
31 pagesIn this paper, we study the set of thresholds that the protagonist can force in a zero-sum t...
This paper presents a technique for approximating, up to any precision, the set of subgame-perfect e...
In this paper, we provide an effective characterization of all thesubgame-perfect equilibria in infi...
International audienceWe study the complexity of problems related to subgame-perfect equilibria (SPE...
International audienceIn this paper, we provide an effective characterization of all the subgame-per...
In this paper, we provide an effective characterization of all the subgame-perfect equilibria in inf...
We study the complexity of finding the values and optimal strategies of mean payoff games, a family ...
We study multiplayer turn-based timed games with reachability objectives. In particular, we are inte...
We study multiplayer quantitative reachability games played on a finite directed graph, where the ob...
How to establish the existence of subgame perfect equilibrium (SPE) in bargaining models if no stati...
How long does it take until economic agents converge to an equilibrium? By studying the complexity o...
Today, as computer systems are ubiquitous in our everyday life, there is no need to argue that their...
We study n-player turn-based games played on a finite directed graph. For each play, the players hav...
The concept of subgame perfect -equilibrium (-SPE), where is an error-term, has in recent years emer...
We study the complexity of finding the values and optimal strategies of mean payoff games on graphs,...
31 pagesIn this paper, we study the set of thresholds that the protagonist can force in a zero-sum t...
This paper presents a technique for approximating, up to any precision, the set of subgame-perfect e...
DOI
Add to ORKG