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

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

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

(75)

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

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)