Pages that link to "Item:Q487011"

The following pages link to Polynomial-time algorithms for energy games with special weight structures (Q487011):

Displaying 11 items.

• Graph operations on parity games and polynomial-time algorithms (Q906273) (← links)
• A convex programming-based algorithm for mean payoff stochastic games with perfect information (Q1686541) (← 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)
• The complexity of multi-mean-payoff and multi-energy games (Q2343132) (← links)
• Looking at mean-payoff and total-payoff through windows (Q2346404) (← links)
• A pseudo-polynomial algorithm for mean payoff stochastic games with perfect information and few random positions (Q2417852) (← links)
• On Nash-solvability in pure stationary strategies of the deterministic \(n\)-person games with perfect information and mean or total effective cost (Q2440107) (← links)
• A note on the approximation of mean-payoff games (Q2446598) (← links)
• (Q2912850) (redirect page) (← links)
• (Q5091276) (← links)