Some Properties of Batch Value of Information in the Selection Problem
(Extended Abstract?)
Abstract
We examine theoretical properties of value of information (VOI) in the selection problem, and identify
cases of submodularity and supermodularity. We
use these properties to compute approximately optimal measurement batch policies, implemented on
a “wine selection problem” example