# 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}
}```
• Published in SODA 2016
• Computer Science, Mathematics
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
• Mathematics, Computer Science
• ACM Trans. Algorithms
• 2019
A Parity Game Tale of Two Counters
• T. V. Dijk
• Computer Science, Mathematics
• GandALF
• 2019
CLS: New Problems and Completeness
• Mathematics, Computer Science
• ArXiv
• 2017

#### References

SHOWING 1-10 OF 46 REFERENCES