Rational synthesis

DOI10.1007/978-3-642-12002-2_16MaRDI QIDQ3557077zbMATH OpenOpenAlexFDO

Authors Dana Fisman, Orna Kupferman, Yoad Lustig

Publication date 27 April 2010

Published in Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-12002-2_16

Mathematics Subject Classification ID

Applications of game theory (91A80) Specification and verification (program logics, model checking, etc.) (68Q60) Agent technology and artificial intelligence (68T42) Temporal logic (03B44)

Recommendations

• Synthesis with rational environments
• The complexity of rational synthesis for concurrent games
• Computer Science Logic
• Assume-Guarantee Synthesis
• The complexity of rational synthesis

Cited in

(73)

• The power of one secret agent
• Equilibria for games with combined qualitative and quantitative objectives
• Dependences in strategy logic
• Dependences in strategy logic
• A game-theoretic approach for the synthesis of complex systems
• Active learning of sequential transducers with side information about the domain
• scientific article; zbMATH DE number 1779552 (Why is no real title available?)
• On the relation between reactive synthesis and supervisory control of non-terminating processes
• Timed network games with clocks
• Of temporary coalitions in terms of concurrent game models, announcements, and temporal projection
• Games with trading of control
• A game of pawns
• On the complexity of rational verification
• Iterated Boolean games
• Timed network games
• Multi-player games with LDL goals over finite traces
• The complexity of subgame perfect equilibria in quantitative reachability games
• Verification with common knowledge of rationality for graph games
• scientific article; zbMATH DE number 7327943 (Why is no real title available?)
• scientific article; zbMATH DE number 7649928 (Why is no real title available?)
• A game of pawns
• scientific article; zbMATH DE number 7649930 (Why is no real title available?)
• An abstraction-refinement methodology for reasoning about network games
• The Complexity of Nash Equilibria in Limit-Average Games
• Repairing multi-player games
• A game-theoretic approach to indistinguishability of winning objectives as user privacy
• Constrained existence problem for weak subgame perfect equilibria with \(\omega \)-regular Boolean objectives
• Timed network games
• Synthesis with rational environments
• Designing equilibria in concurrent games with social welfare and temporal logic constraints
• Automated temporal equilibrium analysis: verification and synthesis of multi-player games
• On high-quality synthesis
• A logic for conditional local strategic reasoning
• Synthesizing safe coalition strategies
• Assume-admissible synthesis
• The adversarial Stackelberg value in quantitative games
• Quantitative reachability Stackelberg-Pareto synthesis is \textsf{NEXPTIME}-complete
• scientific article; zbMATH DE number 7649921 (Why is no real title available?)
• Network-formation games with regular objectives
• Incentive Engineering for Concurrent Games
• Flow logic
• Flow logic
• Characterising and verifying the core in concurrent multi-player mean-payoff games
• As soon as possible but rationally
• Semi-competitive differential game logic
• From model checking to equilibrium checking: reactive modules for rational verification
• Cooperative concurrent games
• Coping with selfish on-going behaviors
• Computer Science Logic
• Reasoning about Quality and Fuzziness of Strategic Behaviors
• Stackelberg-Pareto synthesis
• The complexity of LTL rational synthesis
• Good-enough synthesis
• scientific article; zbMATH DE number 7447731 (Why is no real title available?)
• Reasoning about strategies: on the model-checking problem
• Infinite-duration bidding games
• Existence and verification of Nash equilibria in non-cooperative contribution games with resource contention
• The complexity of rational synthesis
• The Temporal Logic of Coalitional Goal Assignments in Concurrent Multiplayer Games
• Infinite-duration poorman-bidding games
• Finitely defined preference and preference indiscernibility in ATL with strategy contexts
• Cooperative reactive synthesis
• Hierarchical network formation games
• The power of one evil secret agent
• scientific article; zbMATH DE number 7136658 (Why is no real title available?)
• Dynamic resource allocation games
• The complexity of LTL rational synthesis
• Computing adequately permissive assumptions for synthesis
• Synthesis of compact strategies for coordination programs
• Assume-admissible synthesis
• Imperfect information in reactive modules games
• The complexity of rational synthesis for concurrent games
• Assume-Guarantee Synthesis

This page was built for publication: Rational synthesis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3557077)