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

DOI10.4230/LIPICS.ICALP.2022.110MaRDI QIDQ6560909zbMATH OpenFDO

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

Publication date 24 June 2024

Full work available at URL https://doi.org/10.4230/LIPICS.ICALP.2022.110

zbMATH Keywords

entropy gamesmean-payoff gamesparameterized complexityPerron rootseparation boundsvalue iteration

Mathematics Subject Classification ID

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

Cited in

(2)

• Smoothed analysis of deterministic discounted and Mean-payoff games
• Universal complexity bounds based on value iteration for stochastic mean payoff games and entropy games

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)