Computing Game Metrics on Markov Decision Processes

DOI10.1007/978-3-642-31585-5_23zbMath1369.68262OpenAlexW99783039MaRDI QIDQ3167014

Hongfei Fu

Publication date: 1 November 2012

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-31585-5_23

zbMATH Keywords

Markov decision processesapproximate bisimulationgame metrics

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (10)

Converging from branching to linear metrics on Markov chains ⋮ Unnamed Item ⋮ Sound approximate and asymptotic probabilistic bisimulations for PCTL ⋮ Fixpoint Theory -- Upside Down ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Fixpoint theory -- upside down ⋮ Polynomial-time algorithms for computing distances of fuzzy transition systems ⋮ The Complexity of Computing a Bisimilarity Pseudometric on Probabilistic Automata ⋮ Deciding probabilistic bisimilarity distance one for probabilistic automata

This page was built for publication: Computing Game Metrics on Markov Decision Processes