Pages that link to "Item:Q537946"
From MaRDI portal
The following pages link to Faster algorithms for mean-payoff games (Q537946):
Displaying 37 items.
- Down the Borel hierarchy: solving Muller games via safety games (Q477197) (← links)
- Polynomial-time algorithms for energy games with special weight structures (Q487011) (← links)
- Reactive synthesis without regret (Q520338) (← links)
- Pseudopolynomial iterative algorithm to solve total-payoff games and min-cost reachability games (Q520343) (← links)
- Improved pseudo-polynomial bound for the value problem and optimal strategy synthesis in mean payoff games (Q524362) (← links)
- Meet your expectations with guarantees: beyond worst-case synthesis in quantitative games (Q528191) (← links)
- Looking at mean payoff through foggy windows (Q1629743) (← links)
- Safraless LTL synthesis considering maximal realizability (Q1674867) (← links)
- Automated competitive analysis of real-time scheduling with graph games (Q1698779) (← links)
- Checking dynamic consistency of conditional hyper temporal networks via mean payoff games. Hardness and (pseudo) singly-exponential time algorithm (Q1706164) (← links)
- Hyper temporal networks. A tractable generalization of simple temporal networks and its relation to mean payoff games (Q1706770) (← links)
- Energy parity games (Q1758152) (← links)
- Quantitative reductions and vertex-ranked infinite games (Q2029603) (← links)
- Supervisor synthesis and throughput optimization of partially-controllable manufacturing systems (Q2058495) (← links)
- The GKK algorithm is the fastest over simple mean-payoff games (Q2097231) (← links)
- Protocol scheduling (Q2145259) (← links)
- Instantaneous reaction-time in dynamic consistency checking of conditional simple temporal networks (Q2173438) (← links)
- Fixpoint theory -- upside down (Q2233395) (← links)
- A general approach for optimizing dynamic sensor activation for discrete event systems (Q2280709) (← links)
- The complexity of multi-mean-payoff and multi-energy games (Q2343132) (← links)
- Qualitative analysis of concurrent mean-payoff games (Q2346403) (← links)
- Looking at mean-payoff and total-payoff through windows (Q2346404) (← links)
- Hyperplane separation technique for multidimensional mean-payoff games (Q2361356) (← links)
- Average-energy games (Q2413482) (← links)
- A note on the approximation of mean-payoff games (Q2446598) (← links)
- Dynamic Approximate All-Pairs Shortest Paths: Breaking the $O(mn)$ Barrier and Derandomization (Q2816298) (← links)
- USING STRATEGY IMPROVEMENT TO STAY ALIVE (Q2909219) (← links)
- Bounding Average-Energy Games (Q2988367) (← links)
- Graph Games and Reactive Synthesis (Q3176385) (← links)
- (Q3384874) (← links)
- The Theory of Universal Graphs for Infinite Duration Games (Q5043588) (← links)
- Value Iteration Using Universal Graphs and the Complexity of Mean Payoff Games (Q5089201) (← links)
- (Q5091276) (← links)
- (Q5111253) (← links)
- (Q5875382) (← links)
- Enforcing opacity by insertion functions under multiple energy constraints (Q6198145) (← links)
- Solving mean-payoff games via quasi dominions (Q6204169) (← links)
