The Random-Action-Removal algorithm solves n-state, m-action 2-player games in e^{O(√(n ln(m/n)))} time, improving the previous e^{O(√(n ln(m/√n)))} bound by exploiting the hypercube structure of the game.
Guterman.Tropical Polyhedra are Equivalent to mean Payoff Games.Int
1 Pith paper cite this work, alongside 18 external citations. Polarity classification is still indexing.
1
Pith paper citing it
18
external citations · OpenAlex
fields
cs.DS 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Improved subexponential analysis of the Random-Action-Removal algorithm for 2-player turn-based games and non-binary AUSOs
The Random-Action-Removal algorithm solves n-state, m-action 2-player games in e^{O(√(n ln(m/n)))} time, improving the previous e^{O(√(n ln(m/√n)))} bound by exploiting the hypercube structure of the game.