On computing the maximum-entropy probability consistent with a capacity

P. Baroni, P. Vicig

Proc. of IPMU 2006, 11th International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems, Paris, F, 2006, 1732-1739



The problem of computing the maximum-entropy precise probability consistent with a 2-monotone capacity is solved by an algorithm devised by Jaffray. After reviewing its properties, with particular reference to its applicability scope, we introduce a modified version of the algorithm, showing that it works correctly on a strictly larger family of capacities. Finally, an empirical analysis about behavior and performance of the proposed algorithm is carried out.

PDF file

Return to publication list