Item request has been placed! ×
Item request cannot be made. ×
loading  Processing Request

An algorithm for finding the vertices of the k-additive monotone core

Item request has been placed! ×
Item request cannot be made. ×
loading   Processing Request
اقرأ أكثر حفظ في قائمتي
  • معلومة اضافية
    • Contributors:
      Universidad Complutense de Madrid = Complutense University of Madrid Madrid (UCM); Centre d'économie de la Sorbonne (CES); Université Paris 1 Panthéon-Sorbonne (UP1)-Centre National de la Recherche Scientifique (CNRS); Paris School of Economics (PSE); Université Paris 1 Panthéon-Sorbonne (UP1)-École normale supérieure - Paris (ENS-PSL); Université Paris Sciences et Lettres (PSL)-Université Paris Sciences et Lettres (PSL)-École des hautes études en sciences sociales (EHESS)-École des Ponts ParisTech (ENPC)-Centre National de la Recherche Scientifique (CNRS)-Institut National de Recherche pour l’Agriculture, l’Alimentation et l’Environnement (INRAE)
    • بيانات النشر:
      HAL CCSD
      Elsevier
    • الموضوع:
      2012
    • Collection:
      École des Ponts ParisTech: HAL
    • نبذة مختصرة :
      International audience ; 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.
    • Relation:
      hal-00806905; https://hal.science/hal-00806905; https://hal.science/hal-00806905/document; https://hal.science/hal-00806905/file/dam11.pdf
    • الرقم المعرف:
      10.1016/j.dam.2011.11.013
    • الدخول الالكتروني :
      https://hal.science/hal-00806905
      https://hal.science/hal-00806905/document
      https://hal.science/hal-00806905/file/dam11.pdf
      https://doi.org/10.1016/j.dam.2011.11.013
    • Rights:
      info:eu-repo/semantics/OpenAccess
    • الرقم المعرف:
      edsbas.BB4C1787