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

From MaRDI portal

Revision as of 17:01, 13 February 2025 by Import250213030230 (talk | contribs) (Created automatically from import250213030230)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:6560909

Jump to:navigation, search

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 iteration parameterized complexity Perron root mean-payoff games entropy games separation 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)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:6560909&oldid=40090090"