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

Remarkable polyhedra related to set functions, games and capacities

Author

Listed:
  • Michel Grabisch

    () (CES - Centre d'économie de la Sorbonne - UP1 - Université Panthéon-Sorbonne - CNRS - Centre National de la Recherche Scientifique, PSE - Paris School of Economics)

Abstract

Set functions are widely used in many domains of Operations Research (cooperative game theory, decision under risk and uncertainty, combinatorial optimization) under different names (TU-game, capacity, nonadditive measure, pseudo-Boolean function, etc…). Remarkable families of set functions form polyhedra, e.g., the polytope of capacities, the polytope of p-additive capacities, the cone of supermodular games, etc…. Also, the core of a set function, defined as the set of additive set functions dominating that set function, is a polyhedron which is of fundamental importance in game theory, decision making and combinatorial optimization. This survey paper gives an overview of these notions and studies all these polyhedra.

Suggested Citation

  • Michel Grabisch, 2016. "Remarkable polyhedra related to set functions, games and capacities," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-01412292, HAL.
  • Handle: RePEc:hal:cesptp:halshs-01412292
    Note: View the original document on HAL open archive server: https://halshs.archives-ouvertes.fr/halshs-01412292
    as

    Download full text from publisher

    File URL: https://halshs.archives-ouvertes.fr/halshs-01412292/document
    Download Restriction: no

    Other versions of this item:

    References listed on IDEAS

    as
    1. Grabisch, Michel & Sudhölter, Peter, 2014. "On the restricted cores and the bounded core of games on distributive lattices," European Journal of Operational Research, Elsevier, vol. 235(3), pages 709-717.
    2. Ulrich Faigle & Michel Grabisch & Andres Jiménez-Losada & Manuel Ordóñez, 2014. "Games on concept lattices: Shapley value and core," Documents de travail du Centre d'Economie de la Sorbonne 14070, Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne.
    3. Hans Reijnierse & Jean Derks, 1998. "Note On the core of a collection of coalitions," International Journal of Game Theory, Springer;Game Theory Society, vol. 27(3), pages 451-459.
    4. Marina Núñez & Carles Rafels, 1998. "On extreme points of the core and reduced games," Annals of Operations Research, Springer, vol. 84(0), pages 121-133, December.
    5. repec:hal:journl:hal-00625339 is not listed on IDEAS
    6. Michel Grabisch & Pedro Miranda, 2015. "Exact bounds of the Möbius inverse of monotone set functions," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) hal-01136668, HAL.
    7. 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.
    8. repec:hal:cesptp:hal-00803233 is not listed on IDEAS
    9. Bilbao, J. M. & Lebron, E. & Jimenez, N., 1999. "The core of games on convex geometries," European Journal of Operational Research, Elsevier, vol. 119(2), pages 365-372, December.
    10. Miranda, Pedro & Grabisch, Michel, 2010. "k-Balanced games and capacities," European Journal of Operational Research, Elsevier, vol. 200(2), pages 465-472, January.
    11. 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.
    12. Michel Grabisch, 2013. "The core of games on ordered structures and graphs," Annals of Operations Research, Springer, vol. 204(1), pages 33-64, April.
    13. repec:hal:journl:hal-00321625 is not listed on IDEAS
    14. Derks, Jean J M & Gilles, Robert P, 1995. "Hierarchical Organization Structures and Constraints on Coalition Formation," International Journal of Game Theory, Springer;Game Theory Society, vol. 24(2), pages 147-163.
    15. 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.
    16. Michel Grabisch & Peter Sudhölter, 2012. "The bounded core for games with precedence constraints," Annals of Operations Research, Springer, vol. 201(1), pages 251-264, December.
    17. 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.
    18. Michel Grabisch & Peter Sudhölter, 2012. "The Bounded Core for Games with Precedence Constraints," Post-Print halshs-00673909, HAL.
    19. repec:hal:cesptp:halshs-00950109 is not listed on IDEAS
    20. 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.
    21. Michel Grabisch, 2016. "Set Functions, Games and Capacities in Decision Making," Theory and Decision Library C, Springer, number 978-3-319-30690-2, May.
    22. Jeroen Kuipers & Dries Vermeulen & Mark Voorneveld, 2010. "A generalization of the Shapley–Ichiishi result," International Journal of Game Theory, Springer;Game Theory Society, vol. 39(4), pages 585-602, October.
    23. repec:hal:journl:halshs-00445073 is not listed on IDEAS
    24. Faigle, U & Kern, W, 1992. "The Shapley Value for Cooperative Games under Precedence Constraints," International Journal of Game Theory, Springer;Game Theory Society, vol. 21(3), pages 249-266.
    25. 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.
    26. 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.
    27. Jean Derks & Hans Haller & Hans Peters, 2000. "The selectope for cooperative games," International Journal of Game Theory, Springer;Game Theory Society, vol. 29(1), pages 23-38.
    28. Nunez, Marina & Rafels, Carles, 2003. "Characterization of the extreme core allocations of the assignment game," Games and Economic Behavior, Elsevier, vol. 44(2), pages 311-331, August.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    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. Mustapha Ridaoui & Michel Grabisch & Christophe Labreuche, 2018. "An axiomatisation of the Banzhaf value and interaction index for multichoice games," Documents de travail du Centre d'Economie de la Sorbonne 18007, Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne.
    3. repec:eee:ejores:v:271:y:2018:i:1:p:120-140 is not listed on IDEAS
    4. 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.
    5. Mustapha Ridaoui & Michel Grabisch & Christophe Labreuche, 2018. "An axiomatisation of the Banzhaf value and interaction index for multichoices games," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-01814977, HAL.

    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:halshs-01412292. See general information about how to correct material in RePEc.

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

    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 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.

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

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.