Faster algorithms for mean-payoff games
From MaRDI portal
Recommendations
Cites work
- A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games
- Cyclic games and an algorithm to find minimax cycle means in directed graphs
- Cyclical games with prohibitions
- Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
- Faster algorithm for mean-payoff games
- From Parity and Payoff Games to Linear Programming
- scientific article; zbMATH DE number 52331 (Why is no real title available?)
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- scientific article; zbMATH DE number 1500523 (Why is no real title available?)
- Infinite Runs in Weighted Timed Automata with Energy Constraints
- Mean cost cyclical games
- Positional strategies for mean payoff games
- Results on the propositional \(\mu\)-calculus
- The complexity of mean payoff games on graphs
Cited in
(59)- Looking at mean payoff through foggy windows
- Safraless LTL synthesis considering maximal realizability
- Automated competitive analysis of real-time scheduling with graph games
- Faster algorithms for quantitative verification in constant treewidth graphs
- Checking dynamic consistency of conditional hyper temporal networks via mean payoff games. Hardness and (pseudo) singly-exponential time algorithm
- Hyper temporal networks. A tractable generalization of simple temporal networks and its relation to mean payoff games
- Energy parity games
- Quantitative reductions and vertex-ranked infinite games
- Supervisor synthesis and throughput optimization of partially-controllable manufacturing systems
- The GKK algorithm is the fastest over simple mean-payoff games
- Protocol scheduling
- Instantaneous reaction-time in dynamic consistency checking of conditional simple temporal networks
- Fixpoint theory -- upside down
- A general approach for optimizing dynamic sensor activation for discrete event systems
- Faster algorithms for extensive-form game solving via improved smoothing functions
- The complexity of multi-mean-payoff and multi-energy games
- Qualitative analysis of concurrent mean-payoff games
- Looking at mean-payoff and total-payoff through windows
- Hyperplane separation technique for multidimensional mean-payoff games
- Average-energy games
- A note on the approximation of mean-payoff games
- Dynamic approximate all-pairs shortest paths: breaking the \(O(mn)\) barrier and derandomization
- Using strategy improvement to stay alive
- Bounding Average-Energy Games
- Graph Games and Reactive Synthesis
- Quantitative reductions and vertex-ranked infinite games
- Fixed-dimensional energy games are in pseudo-polynomial time
- Incentive Stackelberg mean-payoff games
- On solving mean payoff games using pivoting algorithms
- Down the Borel hierarchy: solving Muller games via safety games
- Average-energy games
- Improvement in small progress measures
- The Theory of Universal Graphs for Infinite Duration Games
- Value Iteration Using Universal Graphs and the Complexity of Mean Payoff Games
- A faster deterministic exponential time algorithm for energy games and mean payoff games
- scientific article; zbMATH DE number 7577577 (Why is no real title available?)
- Faster algorithms for mean-payoff parity games
- A pseudo-quasi-polynomial algorithm for mean-payoff parity games
- Using strategy improvement to stay alive
- Solving mean-payoff games via quasi dominions
- Reactive synthesis without regret
- Pseudopolynomial iterative algorithm to solve total-payoff games and min-cost reachability games
- Improved pseudo-polynomial bound for the value problem and optimal strategy synthesis in mean payoff games
- Meet your expectations with guarantees: beyond worst-case synthesis in quantitative games
- The complexity of infinitely repeated alternating move games
- To reach or not to reach? Efficient algorithms for total-payoff games
- Energy mean-payoff games
- Enforcing opacity by insertion functions under multiple energy constraints
- Solving mean-payoff games via quasi dominions
- Efficient Algorithms for Omega-Regular Energy Games
- Optimal supervisory control of discrete event systems for cyclic tasks
- The worst-case complexity of symmetric strategy improvement
- Fair quantitative games
- Positionality in ^0_2 and a completeness result
- Fast algorithms for energy games in special cases
- Deterministic sub-exponential algorithm for discounted-sum games with unary weights
- Limit your consumption! Finding bounds in average-energy games
- Positionality in _0² and a completeness result
- The complexity of games with randomised control
This page was built for publication: Faster algorithms for mean-payoff games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q537946)
