Miranda Menéndez, Pedro y Grabisch, Michel y Gil, Pedro (2006) Dominance of capacities by k-additive belief functions. European journal of operational research, 175 (2). pp. 912-930. ISSN 0377-2217
Restringido a Sólo personal autorizado del repositorio hasta 2020.
|URL||Tipo de URL|
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.
|Tipo de documento:||Artículo|
|Palabras clave:||Linear programming; Decision analysis; Capacity; Dominance; k-Additivity; Belief functions|
|Materias:||Ciencias > Matemáticas > Investigación operativa|
|Depositado:||13 Nov 2012 10:20|
|Última Modificación:||07 Feb 2014 09:41|
Descargas en el último año
Sólo personal del repositorio: página de control del artículo