IDEAS home Printed from https://ideas.repec.org/p/hal/cesptp/hal-00806905.html
   My bibliography  Save this paper

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

Author

Listed:
  • Pedro Miranda

    (UCM - Universidad Complutense de Madrid = Complutense University of Madrid [Madrid])

  • Michel Grabisch

    (CES - Centre d'économie de la Sorbonne - UP1 - Université Paris 1 Panthéon-Sorbonne - CNRS - Centre National de la Recherche Scientifique, PSE - Paris School of Economics - UP1 - Université Paris 1 Panthéon-Sorbonne - ENS-PSL - École normale supérieure - Paris - PSL - Université Paris Sciences et Lettres - EHESS - École des hautes études en sciences sociales - ENPC - École des Ponts ParisTech - CNRS - Centre National de la Recherche Scientifique - INRAE - Institut National de Recherche pour l’Agriculture, l’Alimentation et l’Environnement)

Abstract

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.

Suggested Citation

  • Pedro Miranda & Michel Grabisch, 2012. "An algorithm for finding the vertices of the k-additive monotone core," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) hal-00806905, HAL.
    • Handle: RePEc:hal:cesptp:hal-00806905
    DOI: 10.1016/j.dam.2011.11.013
    Note: View the original document on HAL open archive server: https://hal.science/hal-00806905
    as

    Download full text from publisher

    File URL: https://hal.science/hal-00806905/document
    Download Restriction: no
    File URL: https://libkey.io/10.1016/j.dam.2011.11.013?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Other versions of this item:

    References listed on IDEAS

    as
    1. Miranda, Pedro & Grabisch, Michel, 2010. "k-Balanced games and capacities," European Journal of Operational Research, Elsevier, vol. 200(2), pages 465-472, January.
    2. Miranda, P. & Combarro, E.F. & Gil, P., 2006. "Extreme points of some families of non-additive measures," European Journal of Operational Research, Elsevier, vol. 174(3), pages 1865-1884, November.
    3. Chateauneuf, Alain & Jaffray, Jean-Yves, 1989. "Some characterizations of lower probabilities and other monotone capacities through the use of Mobius inversion," Mathematical Social Sciences, Elsevier, vol. 17(3), pages 263-283, June.
    4. Michel Grabisch & Pedro Miranda, 2008. "On the vertices of the k-additive core," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) hal-00321625, HAL.
    5. Pedro Miranda & Michel Grabisch & Pedro Gil, 2002. "p-symmetric fuzzy measures," Post-Print hal-00273960, HAL.
    6. Ichiishi, Tatsuro, 1981. "Super-modularity: Applications to convex games and to the greedy algorithm for LP," Journal of Economic Theory, Elsevier, vol. 25(2), pages 283-286, October.
    7. Marichal, Jean-Luc, 2004. "Tolerant or intolerant character of interacting criteria in aggregation by the Choquet integral," European Journal of Operational Research, Elsevier, vol. 155(3), pages 771-791, June.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Michel Grabisch, 2016. "Remarkable polyhedra related to set functions, games and capacities," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 24(2), pages 301-326, July.
    2. Michel Grabisch, 2016. "Remarkable polyhedra related to set functions, games," Documents de travail du Centre d'Economie de la Sorbonne 16081, Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne.
    3. repec:hal:pseose:hal-01372858 is not listed on IDEAS
    4. Grabisch, Michel & Li, Tong, 2011. "On the set of imputations induced by the k-additive core," European Journal of Operational Research, Elsevier, vol. 214(3), pages 697-702, November.
    5. Stéphane Gonzalez & Michel Grabisch, 2015. "Preserving coalitional rationality for non-balanced games," International Journal of Game Theory, Springer;Game Theory Society, vol. 44(3), pages 733-760, August.
    6. repec:hal:pseose:halshs-01235625 is not listed on IDEAS
    7. Miranda, P. & Combarro, E.F. & Gil, P., 2006. "Extreme points of some families of non-additive measures," European Journal of Operational Research, Elsevier, vol. 174(3), pages 1865-1884, November.
    8. Brice Mayag & Michel Grabisch & Christophe Labreuche, 2009. "A characterization of the 2-additive Choquet integral through cardinal information," Post-Print halshs-00445132, HAL.
    9. Grabisch, Michel & Labreuche, Christophe, 2018. "Monotone decomposition of 2-additive Generalized Additive Independence models," Mathematical Social Sciences, Elsevier, vol. 92(C), pages 64-73.
    10. Miranda, Pedro & Grabisch, Michel & Gil, Pedro, 2006. "Dominance of capacities by k-additive belief functions," European Journal of Operational Research, Elsevier, vol. 175(2), pages 912-930, December.
    11. repec:hal:pseose:hal-00803233 is not listed on IDEAS
    12. Miranda, Pedro & Grabisch, Michel, 2010. "k-Balanced games and capacities," European Journal of Operational Research, Elsevier, vol. 200(2), pages 465-472, January.
    13. Michel Grabisch, 2013. "The core of games on ordered structures and graphs," Annals of Operations Research, Springer, vol. 204(1), pages 33-64, April.
    14. Daniel Li Li & Erfang Shan, 2020. "Marginal contributions and derivatives for set functions in cooperative games," Journal of Combinatorial Optimization, Springer, vol. 39(3), pages 849-858, April.
    15. Michel Grabisch & Christophe Labreuche, 2010. "A decade of application of the Choquet and Sugeno integrals in multi-criteria decision aid," Annals of Operations Research, Springer, vol. 175(1), pages 247-286, March.
    16. Jian-Zhang Wu & Yi-Ping Zhou & Li Huang & Jun-Jie Dong, 2019. "Multicriteria Correlation Preference Information (MCCPI)-Based Ordinary Capacity Identification Method," Mathematics, MDPI, vol. 7(3), pages 1-13, March.
    17. Hans Peters, 2016. "Comments on: Remarkable polyhedra related to set functions, games and capacities," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 24(2), pages 330-332, July.
    18. Grabisch, Michel & Kojadinovic, Ivan & Meyer, Patrick, 2008. "A review of methods for capacity identification in Choquet integral based multi-attribute utility theory: Applications of the Kappalab R package," European Journal of Operational Research, Elsevier, vol. 186(2), pages 766-785, April.
    19. Marichal, Jean-Luc, 2007. "k-intolerant capacities and Choquet integrals," European Journal of Operational Research, Elsevier, vol. 177(3), pages 1453-1468, March.
    20. Kojadinovic, Ivan, 2007. "Minimum variance capacity identification," European Journal of Operational Research, Elsevier, vol. 177(1), pages 498-514, February.
    21. Brice Mayag & Michel Grabisch & Christophe Labreuche, 2011. "A representation of preferences by the Choquet integral with respect to a 2-additive capacity," Theory and Decision, Springer, vol. 71(3), pages 297-324, September.
    22. Michel Grabisch, 2015. "Fuzzy Measures and Integrals: Recent Developments," Post-Print hal-01302377, HAL.
    23. Michel Grabisch, 2011. "Ensuring the boundedness of the core of games with restricted cooperation," Annals of Operations Research, Springer, vol. 191(1), pages 137-154, November.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hal:cesptp:hal-00806905. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: CCSD (email available below). General contact details of provider: https://hal.archives-ouvertes.fr/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.