Pages that link to "Item:Q4598263"
From MaRDI portal
The following pages link to The Complexity of Rational Synthesis (Q4598263):
Displaying 13 items.
- Dependences in strategy logic (Q1987514) (← links)
- On subgame perfect equilibria in turn-based reachability timed games (Q1996016) (← links)
- A game-theoretic approach for the synthesis of complex systems (Q2104251) (← links)
- Dependences in Strategy Logic (Q3304133) (← links)
- (Q5009456) (← links)
- (Q5092367) (← links)
- (Q5140263) (← links)
- (Q5875374) (← links)
- On relevant equilibria in reachability games (Q5919688) (← links)
- On the complexity of rational verification (Q6133701) (← links)
- Synthesizing Computable Functions from Rational Specifications Over Infinite Words (Q6195088) (← links)
- The complexity of LTL rational synthesis (Q6535558) (← links)
- Quantitative reachability Stackelberg-Pareto synthesis is \textsf{NEXPTIME}-complete (Q6623016) (← links)
