IDEAS home Printed from
   My bibliography  Save this paper

Max-convex decompositions for cooperative TU games


  • Francesc Llerena
  • Carlos Rafels Pallarola

    (Universitat de Barcelona)


We show that any cooperative TU game is the maximum of a finite collection of convex games. This max-convex decomposition can be refined by using convex games with nonnegative dividends for all coalitions of at least two players. As a consequence of the above results we show that the class of modular games is a set of generators of the distributive lattice of all cooperative TU games. Finally, we characterize zero-monotonic games using a strong max-convex decomposition.

Suggested Citation

  • Francesc Llerena & Carlos Rafels Pallarola, 2004. "Max-convex decompositions for cooperative TU games," Working Papers in Economics 123, Universitat de Barcelona. Espai de Recerca en Economia.
  • Handle: RePEc:bar:bedcje:2004123

    Download full text from publisher

    File URL:
    Download Restriction: no

    References listed on IDEAS

    1. Curiel, I. & Tijs, S.H., 1991. "Minimarg and the maximarg operators," Other publications TiSEM 1f024ef6-4383-41ae-aba6-0, Tilburg University, School of Economics and Management.
    2. Ehud Kalai & Eitan Zemel, 1980. "On Totally Balanced Games and Games of Flow," Discussion Papers 413, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    3. Lucas, William F., 1992. "Von Neumann-Morgenstern stable sets," Handbook of Game Theory with Economic Applications,in: R.J. Aumann & S. Hart (ed.), Handbook of Game Theory with Economic Applications, edition 1, volume 1, chapter 17, pages 543-590 Elsevier.
    4. 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.
    5. Einy, Ezra, 1988. "The shapley value on some lattices of monotonic games," Mathematical Social Sciences, Elsevier, vol. 15(1), pages 1-10, February.
    Full references (including those not matched with items on IDEAS)

    More about this item

    JEL classification:

    • C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games
    • C78 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Bargaining Theory; Matching Theory

    NEP fields

    This paper has been announced in the following NEP Reports:


    Access and download statistics


    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:bar:bedcje:2004123. 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: (Espai de Recerca en Economia). General contact details of provider: .

    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.