The Complexity of All-switches Strategy Improvement

@inproceedings{Fearnley2016TheCO,
  title={The Complexity of All-switches Strategy Improvement},
  author={John Fearnley and Rahul Savani},
  booktitle={SODA},
  year={2016}
}
Strategy improvement is a widely-used and well-studied class of algorithms for solving graph-based infinite games. These algorithms are parameterized by a switching rule, and one of the most natural rules is "all switches" which switches as many edges as possible in each iteration. Continuing a recent line of work, we study all-switches strategy improvement from the perspective of computational complexity. We consider two natural decision problems, both of which have as input a game $G$, a… Expand
The Simplex Algorithm Is NP-Mighty
The complexity of continuous local search
A Parity Game Tale of Two Counters
  • T. V. Dijk
  • Computer Science, Mathematics
  • GandALF
  • 2019
CLS: New Problems and Completeness

References

SHOWING 1-10 OF 46 REFERENCES
The complexity of all-switches strategy improvement
A Discrete Strategy Improvement Algorithm for Solving Parity Games
A subexponential lower bound for the random facet algorithm for parity games
An Optimal Strategy Improvement Algorithm for Solving Parity and Payoff Games
On Algorithms for Simple Stochastic Games
  • A. Condon
  • Computer Science
  • Advances In Computational Complexity Theory
  • 1990
Non-oblivious Strategy Improvement
The Complexity of Mean Payoff Games on Graphs
Linear Complementarity Algorithms for Infinite Games
On Nonterminating Stochastic Games
A Subexponential Lower Bound for Zadeh's Pivoting Rule for Solving Linear Programs and Games
...
1
2
3
4
5
...