Efficient algorithms for minimax decisions under tree-structured incompleteness

DOI10.1007/978-3-030-29765-7_28OpenAlexW2971407865MaRDI QIDQ2297785FDOQ2297785

Authors: Thijs van Ommen, Wouter M. Koolen, Peter D. Grünwald 

Publication date: 20 February 2020

Full work available at URL: https://ir.cwi.nl/pub/28946

Recommendations

• Decision making under incomplete data using the imprecise Dirichlet model
• Optimal decision processes and algorithms
• MAXIMUM ENTROPY ALGORITHMS FOR UNCERTAINTY MEASURES
• Decision-making with incomplete information
• Decision making with incomplete information

zbMATH Keywords

incomplete observationsmaximum entropyminimax decision makingcoarse data

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37)

This page was built for publication: Efficient algorithms for minimax decisions under tree-structured incompleteness

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