1 citations · 1 across the 5 of their papers we have counts for
Showing 2025Show all
3 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…
cs.GT2025
Connecting Strategy Improvement, the Simplex Algorithm and Lopsidedness
Matthew Maat
The strategy improvement algorithm for mean payoff games and parity games is a local improvement algorithm, just like the simplex algorithm for linear programs. Their similarity ha…
cs.GT2025
Cycle Patterns and Mean Payoff Games
Georg Loho, Matthew Maat, Mateusz Skomra
We introduce the concept of a \emph{cycle pattern} for directed graphs as functions from the set of cycles to the set . The key example for such a pattern is derived fro…