On probability-raising causality in Markov decision processes

DOI10.1007/978-3-030-99253-8_3arXiv2201.08768OpenAlexW4226232501MaRDI QIDQ6141758

Florian Funke, Jakob Piribauer, Robin Ziemek, Christel Baier

Publication date: 23 January 2024

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Related Items (1)

Operational causality -- necessarily sufficient and sufficiently necessary

Cites Work

• Unnamed Item
• 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
• Probabilistic causes in Markov chains
• Probabilistic grammars for natural languages
• The Oxford Handbook of Probability and Philosophy
• 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
• Stochastic Shortest Paths and Weight-Bounded Properties in Markov Decision Processes
• What causes a system to satisfy a specification?
• HyperPCTL: A Temporal Logic for Probabilistic Hyperproperties
• Operational causality -- necessarily sufficient and sufficiently necessary

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