Pages that link to "Item:Q2408790"
From MaRDI portal
The following pages link to Computer aided synthesis: a game-theoretic approach (Q2408790):
Displaying 17 items.
- Simplifying optimal strategies in \(\limsup\) and \(\liminf\) stochastic games (Q1627843) (← links)
- On subgame perfect equilibria in turn-based reachability timed games (Q1996016) (← links)
- Perfect information games where each player acts only once (Q1996105) (← links)
- Constrained existence problem for weak subgame perfect equilibria with \(\omega \)-regular Boolean objectives (Q2029600) (← links)
- Subgame perfection in recursive perfect information games (Q2061123) (← links)
- Subgame maxmin strategies in zero-sum stochastic games with tolerance levels (Q2068906) (← links)
- A game-theoretic approach for the synthesis of complex systems (Q2104251) (← links)
- Individual upper semicontinuity and subgame perfect \(\epsilon\)-equilibria in games with almost perfect information (Q2143909) (← links)
- Reachability and safety objectives in Markov decision processes on long but finite horizons (Q2188953) (← links)
- On the existence of weak subgame perfect equilibria (Q2225594) (← links)
- (Q3384875) (← links)
- (Q5140263) (← links)
- The complexity of subgame perfect equilibria in quantitative reachability games (Q5875374) (← links)
- (Q5875382) (← links)
- On relevant equilibria in reachability games (Q5919688) (← links)
- Subgame-perfect Equilibria in Mean-payoff Games (journal version) (Q6178672) (← links)
- A game-theoretic approach to indistinguishability of winning objectives as user privacy (Q6605339) (← links)
