Showing math.OCShow all
2 papers · 1 filter
math.OC2025
Lower bounds for ranking-based pivot rules
Yann Disser, Georg Loho, Matthew Maat +1
The existence of a polynomial pivot rule for the simplex method for linear programming, policy iteration for Markov decision processes, and strategy improvement for parity games ea…
math.OC2025
Reducing Stochastic Games to Semidefinite Program Feasibility
Manuel Bodirsky, Georg Loho, Mateusz Skomra
We present a polynomial-time reduction from max-plus-average constraints to the feasibility problem for semidefinite programs. This shows that Condon's simple stochastic games, sto…