Dominance of capacities by k-additive belief functions

Abstract : In this paper we deal with the set of $k$-additive belief
functions dominating a given capacity. We follow the line
introduced by Chateauneuf and Jaffray for dominating probabilities and continued by Grabisch for general $k$-additive measures.
First, we show that the conditions for the general $k$-additive case lead to a very wide class of functions and this makes that the properties obtained for probabilities are no longer valid. On the other hand, we show that these conditions cannot be improved.
We solve this situation by imposing additional constraints on the dominating functions. Then, we consider the more restrictive case of $k$-additive belief functions. In this case, a similar result with stronger conditions is proved. Although better, this result is not completely satisfactory and, as before, the conditions
cannot be strengthened. However, when the initial capacity is a belief function, we find a subfamily of the set of dominating $k$-additive belief functions from which it is possible to derive any other dominant $k$-additive belief function, and such that the
conditions are even more restrictive, obtaining the natural extension of the result for probabilities. Finally, we apply these results in the fields of Social Welfare Theory and Decision Under Risk.
Document type :
Journal articles
Complete list of metadatas

Cited literature [32 references]  Display  Hide  Download
Contributor : Michel Grabisch <>
Submitted on : Tuesday, November 13, 2007 - 5:20:16 PM
Last modification on : Friday, July 26, 2019 - 11:58:03 AM
Long-term archiving on : Monday, September 24, 2012 - 3:20:26 PM


Files produced by the author(s)




Pedro Miranda, Michel Grabisch, Pedro Gil. Dominance of capacities by k-additive belief functions. European Journal of Operational Research, Elsevier, 2006, 175 (2), pp.912-930. ⟨10.1016/j.ejor.2005.06.018⟩. ⟨halshs-00186905⟩



Record views


Files downloads