Synthesis with rational environments
From MaRDI portal
Recommendations
- Rational synthesis
- Synthesis for Probabilistic Environments
- The complexity of rational synthesis
- Rational synthesis under imperfect information
- scientific article; zbMATH DE number 3947051
- Synthesizing efficient systems in probabilistic environments
- High-Quality Synthesis Against Stochastic Environments
- scientific article; zbMATH DE number 7278100
- Environment Assumptions for Synthesis
Cites work
- scientific article; zbMATH DE number 3139273 (Why is no real title available?)
- scientific article; zbMATH DE number 52331 (Why is no real title available?)
- scientific article; zbMATH DE number 4124989 (Why is no real title available?)
- scientific article; zbMATH DE number 3189696 (Why is no real title available?)
- A course in game theory.
- Algorithmic Game Theory
- Algorithmic mechanism design
- Alternating-time temporal logic
- Assume-admissible synthesis
- Better Quality in Synthesis through Quantitative Objectives
- Beyond Nash equilibrium: solution concepts for the 21st century
- Church's Problem Revisited
- Computer Science Logic
- Discounting in LTL
- Distributed computing meets game theory
- Environment Assumptions for Synthesis
- Formalizing and Reasoning about Quality
- Markov decision processes and regular events
- Pure Nash equilibria in concurrent deterministic games
- Rational synthesis
- Reasoning about strategies
- Reasoning about strategies: on the model-checking problem
- Reexamination of the perfectness concept for equilibrium points in extensive games
- Strategy Logic
- Synthesis with rational environments
- What makes \textsc{Atl}* decidable? A decidable fragment of strategy logic
Cited in
(32)- Cooperative concurrent games
- On the existence of weak subgame perfect equilibria
- Quantitative reachability Stackelberg-Pareto synthesis is \textsf{NEXPTIME}-complete
- On the existence of weak subgame perfect equilibria
- Repairing multi-player games
- Reasoning about Quality and Fuzziness of Strategic Behaviors
- Automated temporal equilibrium analysis: verification and synthesis of multi-player games
- Environment Assumptions for Synthesis
- The complexity of rational synthesis
- scientific article; zbMATH DE number 7649921 (Why is no real title available?)
- Dependences in strategy logic
- Rational synthesis
- The complexity of rational synthesis for concurrent games
- Parameterized complexity of games with monotonically ordered \(\omega\)-regular objectives
- Verification of multi-agent systems with public actions against strategy logic
- Equilibria for games with combined qualitative and quantitative objectives
- Stackelberg-Pareto synthesis
- The complexity of LTL rational synthesis
- The complexity of LTL rational synthesis
- Dependences in strategy logic
- A logic for conditional local strategic reasoning
- On the complexity of rational verification
- Subgame-perfect Equilibria in Mean-payoff Games (journal version)
- The complexity of subgame perfect equilibria in quantitative reachability games
- Multi-player games with LDL goals over finite traces
- scientific article; zbMATH DE number 7649930 (Why is no real title available?)
- Synthesizing Computable Functions from Rational Specifications Over Infinite Words
- Synthesis with rational environments
- scientific article; zbMATH DE number 7447731 (Why is no real title available?)
- A game-theoretic approach for the synthesis of complex systems
- Assume-admissible synthesis
- Quantifying Bounds in Strategy Logic
This page was built for publication: Synthesis with rational environments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q314471)
