|
Título:
|
An algorithm for finding the vertices of the k-additive monotone core
|
|
Autores:
|
Miranda Menéndez, Pedro ;
Grabisch, Michel
|
|
Tipo de documento:
|
texto impreso
|
|
Editorial:
|
Elsevier, 2012
|
|
Dimensiones:
|
application/pdf
|
|
Nota general:
|
info:eu-repo/semantics/restrictedAccess
|
|
Idiomas:
|
|
|
Palabras clave:
|
Estado = Publicado
,
Materia = Ciencias: Estadística: Teoría de Juegos
,
Tipo = Artículo
|
|
Resumen:
|
Given a capacity, the set of dominating k-additive capacities is a convex polytope called the k-additive monotone core; thus, it is defined by its vertices. In this paper, we deal with the problem of deriving a procedure to obtain such vertices in the line of the results of Shapley and Ichiishi for the additive case. We propose an algorithm to determine the vertices of the n-additive monotone core and we explore the possible translations for the k-additive case.
|
|
En línea:
|
https://eprints.ucm.es/id/eprint/16860/1/Miranda01.pdf
|
