Pages that link to "Item:Q314471"

The following pages link to Synthesis with rational environments (Q314471):

Displaying 26 items.

• Synthesis with rational environments (Q314471) (← links)
• Assume-admissible synthesis (Q520340) (← links)
• Verification of multi-agent systems with public actions against strategy logic (Q785241) (← links)
• Equilibria for games with combined qualitative and quantitative objectives (Q824280) (← links)
• Dependences in strategy logic (Q1987514) (← links)
• A game-theoretic approach for the synthesis of complex systems (Q2104251) (← links)
• A logic for conditional local strategic reasoning (Q2155205) (← links)
• Automated temporal equilibrium analysis: verification and synthesis of multi-player games (Q2211871) (← links)
• On the existence of weak subgame perfect equilibria (Q2225594) (← links)
• Multi-player games with LDL goals over finite traces (Q2225596) (← links)
• Cooperative concurrent games (Q2680769) (← links)
• On the Existence of Weak Subgame Perfect Equilibria (Q2988365) (← links)
• Dependences in Strategy Logic (Q3304133) (← links)
• (Q3384875) (← links)
• Environment Assumptions for Synthesis (Q3541016) (← links)
• (Q5009445) (← links)
• (Q5009456) (← links)
• Quantifying Bounds in Strategy Logic (Q5079747) (← links)
• (Q5140263) (← links)
• The complexity of subgame perfect equilibria in quantitative reachability games (Q5875374) (← links)
• (Q5875383) (← links)
• On the complexity of rational verification (Q6133701) (← links)
• Subgame-perfect Equilibria in Mean-payoff Games (journal version) (Q6178672) (← 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)