Measuring Permissivity in Finite Games
From MaRDI portal
Recommendations
Cites work
- Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
- scientific article; zbMATH DE number 1903345 (Why is no real title available?)
- Hybrid Systems: Computation and Control
- Model-Checking Timed ATL for Durational Concurrent Game Structures
- Permissive strategies: from parity games to safety games
- Quantitative stochastic parity games
- The complexity of mean payoff games on graphs
- Timed Alternating-Time Temporal Logic
Cited in
(8)- Compositional construction of most general controllers
- A compositional framework for controller synthesis
- Measuring Permissiveness in Parity Games: Mean-Payoff Parity Games Revisited
- Permissive strategies: from parity games to safety games
- Strategy templates for almost-sure and positive winning of stochastic parity games towards permissive and resilient control
- Winning strategy templates for stochastic parity games towards permissive and resilient control
- Permissive equilibria in multiplayer reachability games
- Measuring influence in command games
This page was built for publication: Measuring Permissivity in Finite Games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3184674)