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

On the computation of the nucleolus of a cooperative game

  • Jeroen Kuipers

    ()

    (Department of Mathematics, Maastricht University, P.O.Box 616, 6200 MD Maastricht, The Netherlands. E-mail address: kuipers@math.unimaas.nl)

  • Ulrich Faigle

    ()

    (Zentrum für Angewandte Informatik, Universität zu Köln, Weyertal 80, 50931 Köln, Germany. E-mail address: faigle@zpr.uni-koeln.de)

  • Walter Kern

    ()

    (Department of Applied Mathematics, University of Twente, P.O.Box 217, 7500 AE Enschede, The Netherlands. E-mail address: kern@math.utwente.nl)

We consider classes of cooperative games. We show that we can efficiently compute an allocation in the intersection of the prekernel and the least core of the game if we can efficiently compute the minimum excess for any given allocation. In the case where the prekernel of the game contains exactly one core vector, our algorithm computes the nucleolus of the game. This generalizes both a recent result by Kuipers on the computation of the nucleolus for convex games and a classical result by Megiddo on the nucleolus of standard tree games to classes of more general minimum cost spanning tree games. Our algorithm is based on the ellipsoid method and Maschler's scheme for approximating the prekernel.

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://link.springer.de/link/service/journals/00182/papers/1030001/10300079.pdf
Download Restriction: Access to the full text of the articles in this series is restricted

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.

Article provided by Springer in its journal International Journal of Game Theory.

Volume (Year): 30 (2001)
Issue (Month): 1 ()
Pages: 79-98

as
in new window

Handle: RePEc:spr:jogath:v:30:y:2001:i:1:p:79-98
Note: Received February 2000/Final version April 2001
Contact details of provider: Web page: http://link.springer.de/link/service/journals/00182/index.htm

Order Information: Web: http://link.springer.de/orders.htm

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

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:spr:jogath:v:30:y:2001:i:1:p:79-98. 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: (Guenther Eichhorn)

or (Christopher F Baum)

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.