# 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

#### Figures and Topics from this paper

#### 4 Citations

The Simplex Algorithm Is NP-Mighty

- Mathematics, Computer Science
- ACM Trans. Algorithms
- 2019

#### References

SHOWING 1-10 OF 46 REFERENCES

A Discrete Strategy Improvement Algorithm for Solving Parity Games

- Computer Science
- CAV
- 2000

A subexponential lower bound for the random facet algorithm for parity games

- Computer Science, Mathematics
- SODA '11
- 2011

An Optimal Strategy Improvement Algorithm for Solving Parity and Payoff Games

- Computer Science
- CSL
- 2008

On Algorithms for Simple Stochastic Games

- Computer Science
- Advances In Computational Complexity Theory
- 1990

The Complexity of Mean Payoff Games on Graphs

- Computer Science, Mathematics
- Theor. Comput. Sci.
- 1996

A Subexponential Lower Bound for Zadeh's Pivoting Rule for Solving Linear Programs and Games

- Mathematics, Computer Science
- IPCO
- 2011