@InProceedings{disser_et_al:LIPIcs.ISAAC.2023.27,
author = {Disser, Yann and Mosis, Nils},
title = {{A Unified Worst Case for Classical Simplex and Policy Iteration Pivot Rules}},
booktitle = {34th International Symposium on Algorithms and Computation (ISAAC 2023)},
pages = {27:1--27:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-289-1},
ISSN = {1868-8969},
year = {2023},
volume = {283},
editor = {Iwata, Satoru and Kakimura, Naonori},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.27},
URN = {urn:nbn:de:0030-drops-193292},
doi = {10.4230/LIPIcs.ISAAC.2023.27},
annote = {Keywords: Bland’s pivot rule, Dantzig’s pivot rule, Largest Increase pivot rule, Markov decision process, policy iteration, simplex algorithm}
}