Universal complexity bounds based on value iteration and application to entropy games

DOI10.4230/LIPICS.ICALP.2022.110MaRDI QIDQ6560909FDOQ6560909

Mateusz Skomra, Ricardo D. Katz, Xavier Allamigeon, Stéphane Gaubert

Publication date: 24 June 2024

zbMATH Keywords

value iterationparameterized complexityPerron rootmean-payoff gamesentropy gamesseparation bounds

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

This page was built for publication: Universal complexity bounds based on value iteration and application to entropy games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6560909)