1 citations · 1 across the 5 of their papers we have counts for
Showing cs.GTShow all
3 papers · 1 filter
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…
cs.GT2023★ 1 cited
The Worst-Case Complexity of Symmetric Strategy Improvement
Tom van Dijk, Georg Loho, Matthew Maat
Symmetric strategy improvement is an algorithm introduced by Schewe et al. (ICALP 2015) that can be used to solve two-player games on directed graphs such as parity games and mean…