Foundations of probability-raising causality in Markov decision processes

DOI10.46298/lmcs-20(1:4)2024arXiv2209.02973v6MaRDI QIDQ6151547

Christel Baier, Jakob Piribauer, Robin Ziemek

Publication date: 11 March 2024

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2209.02973v6

zbMATH Keywords

Markov decision processprobabilistic causalitybinary classifierprobabilistic-raising

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Explaining counterexamples using causality
• Counterfactuals and comparative possibility
• Quadratic programming with one negative eigenvalue is NP-hard
• A taxonomy of complexity classes of functions
• Quadratic programming is in NP
• Quantitative Analysis under Fairness Constraints
• The polynomial solvability of convex quadratic programming
• An Analysis of Stochastic Shortest Path Problems
• Probabilistic Causality
• Stochastic Shortest Path Games
• Distant Group Responsibility in Multi-agent Systems
• What causes a system to satisfy a specification?
• HyperPCTL: A Temporal Logic for Probabilistic Hyperproperties
• Temporal causality in reactive systems

This page was built for publication: Foundations of probability-raising causality in Markov decision processes