IDEAS home Printed from https://ideas.repec.org/
MyIDEAS: Login to save this paper or follow this series

On the restricted cores and the bounded core of games on distributive lattices

  • Michel Grabisch

    ()

    (Axe Economie mathématique et jeux - CES - Centre d'économie de la Sorbonne - UP1 - Université Panthéon-Sorbonne - CNRS - EEP-PSE - Ecole d'Économie de Paris - Paris School of Economics)

  • Peter Sudhölter

    ()

    (University of Southern Denmark - Department of Business and Economics and COHERE)

We consider TU-games with restricted cooperation, where the set of feasible coalitions is a distributive lattice, hence generated by a partial order on the set of players. In such a situation, the core may be unbounded, and one has to select a bounded part of the core as a solution concept. The restricted core is obtained by imposing equality constraints in the core for sets belonging to so-called normal collections, resulting (if nonempty) in the selection of a bounded face of the core. The bounded core proves to be the union of all bounded faces (restricted cores). The paper aims at investigating in depth the relation between the bounded core and restricted cores, as well as the properties and structures of the restricted cores and normal collections. In particular, it is found that a game is convex if and only if all restricted cores corresponding to the minimal nested normal collections are nonempty. Moreover, in this case the union of these restricted cores already covers the bounded core.

If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.

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

Paper provided by HAL in its series Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) with number halshs-00748331.

as
in new window

Length:
Date of creation: Oct 2012
Date of revision:
Handle: RePEc:hal:cesptp:halshs-00748331
Note: View the original document on HAL open archive server: https://halshs.archives-ouvertes.fr/halshs-00748331
Contact details of provider: Web page: https://hal.archives-ouvertes.fr/

References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:

as in new window
  1. Bilbao, J. M., 1998. "Axioms for the Shapley value on convex geometries," European Journal of Operational Research, Elsevier, vol. 110(2), pages 368-376, October.
  2. Michel Grabisch, 2011. "Ensuring the boundedness of the core of games with restricted cooperation," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) hal-00650964, HAL.
  3. Pulido, Manuel A. & Sanchez-Soriano, Joaquin, 2006. "Characterization of the core in games with restricted cooperation," European Journal of Operational Research, Elsevier, vol. 175(2), pages 860-869, December.
  4. Michel Grabisch & Peter Sudhölter, 2012. "The Bounded Core for Games with Precedence Constraints," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-00673909, HAL.
  5. Béal, Sylvain & Rémila, Eric & Solal, Philippe, 2010. "Rooted-tree solutions for tree games," European Journal of Operational Research, Elsevier, vol. 203(2), pages 404-408, June.
  6. Michel Grabisch & Lijue Xie, 2011. "The restricted core of games on distributive lattices: how to share benefits in a hierarchy," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-00583868, HAL.
  7. Derks, Jean J M & Gilles, Robert P, 1995. "Hierarchical Organization Structures and Constraints on Coalition Formation," International Journal of Game Theory, Springer, vol. 24(2), pages 147-63.
  8. repec:spr:compst:v:74:y:2011:i:1:p:41-52 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. Faigle, U. & Grabisch, M. & Heyne, M., 2010. "Monge extensions of cooperation and communication structures," European Journal of Operational Research, Elsevier, vol. 206(1), pages 104-110, October.
  11. Péter Csóka & P. Jean-Jacques Herings & László Á. Kóczy, 2007. "Balancedness Conditions for Exact Games," Working Paper Series 0805, Óbuda University, Keleti Faculty of Business and Management, revised May 2008.
  12. Michel Grabisch & Lijue Xie, 2008. "The core of games on distributive lattices : how to share benefits in a hierarchy," Documents de travail du Centre d'Economie de la Sorbonne b08077, Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne, revised Sep 2009.
  13. Peter Sudhölter & Yan-An Hwang, 2001. "Axiomatizations of the core on the universal domain and other natural domains," International Journal of Game Theory, Springer, vol. 29(4), pages 597-623.
  14. repec:hal:journl:halshs-00445171 is not listed on IDEAS
  15. repec:hal:journl:halshs-00583868 is not listed on IDEAS
  16. Faigle, U & Kern, W, 1992. "The Shapley Value for Cooperative Games under Precedence Constraints," International Journal of Game Theory, Springer, vol. 21(3), pages 249-66.
  17. Michel Grabisch, 2009. "The core of games on ordered structures and graphs," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-00445171, HAL.
  18. repec:hal:journl:halshs-00344802 is not listed on IDEAS
  19. repec:hal:journl:halshs-00673909 is not listed on IDEAS
  20. repec:hal:cesptp:hal-00759893 is not listed on IDEAS
  21. repec:spr:compst:v:73:y:2011:i:2:p:189-208 is not listed on IDEAS
  22. 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.
Full references (including those not matched with items on IDEAS)

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

When requesting a correction, please mention this item's handle: RePEc:hal:cesptp:halshs-00748331. 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)

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 references are entirely missing, you can add them using this form.

If the full references list an item that is present in RePEc, but the system did not link 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 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.

This information is provided to you by IDEAS at the Research Division of the Federal Reserve Bank of St. Louis using RePEc data.