Pages that link to "Item:Q5311140"
From MaRDI portal
The following pages link to Mathematical Foundations of Computer Science 2004 (Q5311140):
Displaying 13 items.
- Improved pseudo-polynomial bound for the value problem and optimal strategy synthesis in mean payoff games (Q524362) (← links)
- Combinatorial structure and randomized subexponential algorithms for infinite games (Q817809) (← links)
- A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games (Q867862) (← links)
- Unique sink orientations of grids (Q930596) (← links)
- A convex programming-based algorithm for mean payoff stochastic games with perfect information (Q1686541) (← links)
- A pseudo-polynomial algorithm for mean payoff stochastic games with perfect information and few random positions (Q2417852) (← links)
- A policy iteration algorithm for zero-sum stochastic games with mean payoff (Q2504730) (← links)
- Using strategy improvement to stay alive (Q2909219) (← links)
- Temporal Specifications with Accumulative Values (Q2946736) (← links)
- Graph Games and Reactive Synthesis (Q3176385) (← links)
- On an algorithm for successive improvement of a strategy (Q3761429) (← links)
- Solving Mean-Payoff Games via Quasi Dominions (Q5164175) (← links)
- Solving mean-payoff games via quasi dominions (Q6204169) (← links)