The Complexity of All-switches Strategy Improvement

DOI10.1137/1.9781611974331.ch10zbMath1417.91132OpenAlexW2901579914MaRDI QIDQ4575585

John Fearnley, Rahul Savani

Publication date: 16 July 2018

Published in: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611974331.ch10

zbMATH Keywords

complexitystrategy improvementgraph-based infinite games

Mathematics Subject Classification ID

Games involving graphs (91A43) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (5)

Unique end of potential line ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unique End of Potential Line

This page was built for publication: The Complexity of All-switches Strategy Improvement