Pages that link to "Item:Q3587467"
From MaRDI portal
The following pages link to Exponential Lower Bounds for Policy Iteration (Q3587467):
Displayed 20 items.
- Improved bound on the worst case complexity of policy iteration (Q1785761) (← links)
- The stochastic shortest path problem: a polyhedral combinatorics perspective (Q2183321) (← links)
- Simple stochastic games with almost-sure energy-parity objectives are in NP and conp (Q2233425) (← links)
- Numerical invariants through convex relaxation and max-strategy iteration (Q2248100) (← links)
- A complexity analysis of policy iteration through combinatorial matrices arising from unique sink orientations (Q2363352) (← links)
- Recursive stochastic games with positive rewards (Q2422034) (← links)
- Optimal schedulers vs optimal bases: an approach for efficient exact solving of Markov decision processes (Q2453111) (← links)
- A Subexponential Lower Bound for Zadeh’s Pivoting Rule for Solving Linear Programs and Games (Q3009763) (← links)
- Symmetric Strategy Improvement (Q3449491) (← links)
- The Simplex Method is Strongly Polynomial for Deterministic Markov Decision Processes (Q3465936) (← links)
- (Q4553289) (← links)
- Multigrid methods for two‐player zero‐sum stochastic games (Q4921813) (← links)
- (Q5028462) (← links)
- Parity Games: Zielonka's Algorithm in Quasi-Polynomial Time (Q5092368) (← links)
- Towards solving 2-TBSG efficiently (Q5135251) (← links)
- Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes (Q5965568) (← links)
- An exponential lower bound for Zadeh's pivot rule (Q6038661) (← links)
- Universal algorithms for parity games and nested fixpoints (Q6113979) (← links)
- Continuous Positional Payoffs (Q6135780) (← links)
- Improved complexity analysis of quasi-polynomial algorithms solving parity games (Q6149052) (← links)