Answers are grounded in this paper and cite their sources.
A common procedure for selecting a particular density from a given class of densities is to choose one with maximum entropy. The problem addressed here is this. Let S be a finite set and let B be a belief function on 2 S . Then B induces a density on 2 S , which in turn induces a host of densities on S. Provide an algorithm for choosing from this host of densities one with maximum entropy.
No takes yet. Share an insight, caveat, or question.
Meyerowitz et al. (1994) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: