The following pages link to Admissibility in Infinite Games (Q3590934):
Displaying 18 items.
- Assume-admissible synthesis (Q520340) (← links)
- Constrained existence problem for weak subgame perfect equilibria with \(\omega \)-regular Boolean objectives (Q2029600) (← links)
- Improving parity games in practice (Q2043434) (← links)
- A game-theoretic approach for the synthesis of complex systems (Q2104251) (← links)
- On the existence of weak subgame perfect equilibria (Q2225594) (← links)
- Static search games played over graphs and general metric spaces (Q2356189) (← links)
- Solving Parity Games Using an Automata-Based Algorithm (Q2830208) (← links)
- On the Existence of Weak Subgame Perfect Equilibria (Q2988365) (← links)
- Admissible Strategies in Infinite Games over Graphs (Q3182935) (← links)
- Synthesis for Structure Rewriting Systems (Q3182943) (← links)
- (Q3384875) (← links)
- (Q3384876) (← links)
- (Q4636592) (← links)
- (Q5079732) (← links)
- (Q5140263) (← links)
- The complexity of subgame perfect equilibria in quantitative reachability games (Q5875374) (← links)
- With a little help from your friends: semi-cooperative games via joker moves (Q6535468) (← links)
- Quantitative reachability Stackelberg-Pareto synthesis is \textsf{NEXPTIME}-complete (Q6623016) (← links)
