Reasoning about Quality and Fuzziness of Strategic Behaviors
From MaRDI portal
Publication:6116358
DOI10.1145/3582498arXiv1905.11537OpenAlexW4319736260MaRDI QIDQ6116358
Patricia Bouyer, Aniello Murano, Giuseppe Perelli, Nicolas Markey, Bastien Maubert, Orna Kupferman
Publication date: 18 July 2023
Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1905.11537
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Synthesis with rational environments
- Assume-admissible synthesis
- Doomsday equilibria for omega-regular games
- Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra
- Stochastic game logic
- Games with secure equilibria
- Augmenting ATL with strategy contexts
- Strategy logic
- Automata-theoretic techniques for modal logics of programs
- The temporal semantics of concurrent programs
- Positional strategies for mean payoff games
- Computation, logic, philosophy. A collection of essays
- The complexity of mean payoff games on graphs
- Graded modalities in strategy logic
- Latticed-LTL synthesis in the presence of noisy inputs
- On equilibria in quantitative games with reachability/safety objectives
- Modalities for model checking: Branching time logic strikes back
- Quantitative assume guarantee synthesis
- How much can taxes help selfish routing?
- Model checking discounted temporal properties
- Robust Equilibria in Mean-Payoff Games
- Algorithmic mechanism design (extended abstract)
- What Makes Atl* Decidable? A Decidable Fragment of Strategy Logic
- Quantified CTL: Expressiveness and Complexity
- Temporal Specifications with Accumulative Values
- Fuzzy Time in Linear Temporal Logic
- Reasoning About Strategies
- Robust discrete synthesis against unspecified disturbances
- On synthesizing robust discrete controllers under modeling uncertainty
- Formally Reasoning About Quality
- Averaging in LTL
- Alternating-time temporal logic
- On the Complexity of Model-Checking Branching and Alternating-Time Temporal Logics in One-Counter Systems
- Timed Alternating-Time Temporal Logic
- Model-Checking Timed ATL for Durational Concurrent Game Structures
- Timed Concurrent Game Structures
- Infinite Runs in Weighted Timed Automata with Energy Constraints
- Rational Synthesis
- Admissibility in Infinite Games
- “Sometimes” and “not never” revisited
- Augmenting branching temporal logics with existential quantification over atomic propositions
- Secure equilibria in weighted games
- Fuzzy Languages
- Quantifying Bounds in Strategy Logic
- Weighted Strategy Logic with Boolean Goals Over One-Counter Games.
- High-Quality Synthesis Against Stochastic Environments
- An automata-theoretic approach to branching-time model checking
- From Nondeterministic B\"uchi and Streett Automata to Deterministic Parity Automata
- Algorithmic Game Theory
- Discounting in LTL
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Stochastic Games