Strategy Representation by Decision Trees with Linear Classifiers

DOI10.1007/978-3-030-30281-8_7MaRDI QIDQ6488998zbMATH OpenFDO

Authors Pranav Ashok, Tomáš Brázdil, Krishnendu Chatterjee, Jan Křetínský, Christoph H. Lampert, Viktor Toman

Publication date 14 March 2024

Full work available at URL https://doi.org/10.1007/978-3-030-30281-8_7

Mathematics Subject Classification ID

Data structures (68P05) Specification and verification (program logics, model checking, etc.) (68Q60) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Learning and adaptive systems in artificial intelligence (68T05) Markov and semi-Markov decision processes (90C40) Applications of game theory (91A80)

Recommendations

• Strategy representation by decision trees in reactive synthesis
• scientific article; zbMATH DE number 2077117
• Optimal Strategy Synthesis in Stochastic Müller Games
• Synthesising Succinct Strategies in Safety and Reachability Games
• Strategy Synthesis for Markov Decision Processes and Branching-Time Logics

Cited in

(1)

• Explaining control policies through predicate decision diagrams

This page was built for publication: Strategy Representation by Decision Trees with Linear Classifiers

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