Advanced Search
MyIDEAS: Login to save this article or follow this journal

U-CYCLES IN n-PERSON TU-GAMES WITH ONLY 1, n - 1 AND n-PERSON PERMISSIBLE COALITIONS

Contents:

Author Info

  • JUAN CARLOS CESCO

    ()
    (Instituto de Matemática Aplicada San Luis (UNSL-CONICET), Av. Ejército de los Andes 950, 5700 San Luis, Argentina)

  • ANA LUCÍA CALÍ

    ()
    (Departamento de Matemática (U.N. San Luis), Chacabuco y Pedernera, 5700 San Luis, Argentina)

Abstract

It has been recently proved that the non-existence of certain type of cycles of pre-imputation, fundamental cycles, is equivalent to the balancedness of a TU-games (Cesco (2003)). In some cases, the class of fundamental cycles can be narrowed and still obtain a characterization theorem. In this paper we prove that existence of maximal U-cycles, which are related to a transfer scheme designed for computing a point in the core of a game, is condition necessary and sufficient for a TU-game be non-balanced, provided n - 1 and n-person are the only coalitions with non-zero value. These games are strongly related to games with only 1, n - 1 and n-person permissible coalitions (Maschler (1963)).

Download Info

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: http://www.worldscinet.com/cgi-bin/details.cgi?type=pdf&id=pii:S0219198906000965
Download Restriction: Access to full text is restricted to subscribers.

File URL: http://www.worldscinet.com/cgi-bin/details.cgi?type=html&id=pii:S0219198906000965
Download Restriction: Access to full text is restricted to subscribers.

As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.

Bibliographic Info

Article provided by World Scientific Publishing Co. Pte. Ltd. in its journal International Game Theory Review.

Volume (Year): 08 (2006)
Issue (Month): 03 ()
Pages: 355-368

as in new window
Handle: RePEc:wsi:igtrxx:v:08:y:2006:i:03:p:355-368

Contact details of provider:
Web page: http://www.worldscinet.com/igtr/igtr.shtml

Order Information:
Email:

Related research

Keywords: Non balanced games; cycles; transfer schemes;

Find related papers by JEL classification:

References

No references listed on IDEAS
You can help add them by filling out this form.

Citations

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

Cited by:
  1. Cesco, Juan Carlos, 2008. "A general characterization for non-balanced games in terms of U-cycles," European Journal of Operational Research, Elsevier, Elsevier, vol. 191(2), pages 409-415, December.

Lists

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

Statistics

Access and download statistics

Corrections

When requesting a correction, please mention this item's handle: RePEc:wsi:igtrxx:v:08:y:2006:i:03:p:355-368. 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: (Tai Tone Lim).

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.