Optimizing Winning Strategies in Regular Infinite Games
From MaRDI portal
Recommendations
Cites work
- Efficient minimization of deterministic weak -automata
- Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata
- Infinite games on finitely coloured graphs with applications to automata on infinite trees
- Memory Reduction for Strategies in Infinite Games
- On the synthesis of strategies in infinite games
- Parametric temporal logic for “model measuring”
- Simulation Relations for Alternating Parity Automata and Parity Games
- Solving Sequential Conditions by Finite-State Strategies
- Symbolic synthesis of finite-state controllers for request-response specifications
- The complexity of mean payoff games on graphs
Cited in
(11)- Playing with mixed strategies on infinite sets
- scientific article; zbMATH DE number 6486247 (Why is no real title available?)
- Memory Reduction for Strategies in Infinite Games
- Time-Optimal Winning Strategies for Poset Games
- scientific article; zbMATH DE number 1096547 (Why is no real title available?)
- scientific article; zbMATH DE number 2077117 (Why is no real title available?)
- On the synthesis of strategies in infinite games
- Efficient chip strategies in repeated games
- Optimal strategies in weighted limit games
- scientific article; zbMATH DE number 7676368 (Why is no real title available?)
- How Much Lookahead is Needed to Win Infinite Games?
This page was built for publication: Optimizing Winning Strategies in Regular Infinite Games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5448640)