IDEAS home Printed from https://ideas.repec.org/a/spr/jogath/v33y2004i1p107-114.html
   My bibliography  Save this article

An intersection theorem in TU cooperative game theory

Author

Listed:
  • F. Javier Martínez-de-Albéniz
  • Carles Rafels

Abstract

We prove a theorem on the intersection of the Weber sets (Weber, 1988) of two ordered cooperative games. From this theorem several consequences are derived, the inclusion of the core in the Weber set (Weber, 1988), the fact that every convex game has a large core (Sharkey, 1982), and a discrete separation theorem (Frank, 1982). We introduce a definition of general largeness, proving that the Weber set is large for any cooperative game. Copyright Springer-Verlag 2004

Suggested Citation

  • F. Javier Martínez-de-Albéniz & Carles Rafels, 2004. "An intersection theorem in TU cooperative game theory," International Journal of Game Theory, Springer;Game Theory Society, vol. 33(1), pages 107-114, January.
    • Handle: RePEc:spr:jogath:v:33:y:2004:i:1:p:107-114
    DOI: 10.1007/s001820400188
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s001820400188
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s001820400188?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

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


    Cited by:

    1. F. Martínez-de-Albéniz & Carles Rafels, 2007. "Minimal large sets for cooperative games," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 15(2), pages 242-255, December.
    2. Francesc Llerena & Carles Rafels, 2013. "Stable sets and max-convex decompositions of TU games," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 21(2), pages 313-322, July.
    3. Sang-Chul Suh & Yuntong Wang, 2016. "Pollution Permit Sharing Games," Working Papers 1604, University of Windsor, Department of Economics.

    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:spr:jogath:v:33:y:2004:i:1:p:107-114. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.