Minimal disclosure in partially observable Markov decision processes

DOI10.4230/LIPICS.FSTTCS.2011.411zbMATH Open1246.68164MaRDI QIDQ2911642FDOQ2911642

Authors: Nathalie Bertrand, Blaise Genest 

Publication date: 31 August 2012

Recommendations

• Optimal cost almost-sure reachability in POMDPs
• Nonapproximability results for partially observable Markov decision processes
• Qualitative analysis of partially-observable Markov decision processes
• Partially Observable Risk-Sensitive Markov Decision Processes
• POMDPs under probabilistic semantics

zbMATH Keywords

partially observable Markov decision processesstochastic gamesmodel-checkingworst-case/average-case analysis

Mathematics Subject Classification ID

Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Specification and verification (program logics, model checking, etc.) (68Q60) Markov and semi-Markov decision processes (90C40) Stochastic games, stochastic differential games (91A15)

Cited In (1)

• Optimal cost almost-sure reachability in POMDPs

This page was built for publication: Minimal disclosure in partially observable Markov decision processes

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