Computing Game Metrics on Markov Decision Processes

DOI10.1007/978-3-642-31585-5_23MaRDI QIDQ3167014zbMATH OpenOpenAlexFDO

Authors 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

approximate bisimulationgame metricsMarkov decision processes

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)

Recommendations

• Markov decision processes and stochastic games with total effective payoff
• Recursive Markov decision processes and recursive stochastic games
• Automata, Languages and Programming
• scientific article; zbMATH DE number 440593
• scientific article; zbMATH DE number 1187956
• Observation, measurement, and computation in finite games
• Computing Equilibria of Dynamic Games
• Computing equilibria in multi-player games
• scientific article; zbMATH DE number 1376821

Cited in

(19)

• Polynomial-time algorithms for computing distances of fuzzy transition systems
• Computing branching distances with quantitative games
• Fixpoint theory -- upside down
• Deciding probabilistic bisimilarity distance one for probabilistic automata
• Algorithms for game metrics
• Computing behavioral distances, compositionally
• Algorithms for Game Metrics
• Bisimulation metrics for continuous Markov decision processes
• Game Refinement Relations and Metrics
• Converging from branching to linear metrics on Markov chains
• Deciding probabilistic bisimilarity distance one for probabilistic automata
• The complexity of computing a bisimilarity pseudometric on probabilistic automata
• Bisimulation for Markov decision processes through families of functional expressions
• Simulation Hemi-metrics between Infinite-State Stochastic Games
• Long-term values in Markov decision processes and repeated games, and a new distance for probability spaces
• Computing probabilistic bisimilarity distances for probabilistic automata
• Computing probabilistic bisimilarity distances for probabilistic automata
• Sound approximate and asymptotic probabilistic bisimulations for PCTL
• Fixpoint Theory -- Upside Down

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

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