On the computation of the nucleolus of a cooperative game

Faigle, Ulrich and Kern, Walter and Kuipers, Jeroen (2001) On the computation of the nucleolus of a cooperative game.
Published in: International journal of game theory : official journal of the Game Theory Society Vol. 30 (1). pp. 79-98.

Abstract

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.


Actions:
Download: [img] Postscript - Preprinted Version
Download (230kB) | Preview
Editorial actions: View Item View Item (Login required)
Deposit Information:
ZAIK Number: zaik1999-363
Depositing User: Prof. Dr. Ulrich Faigle
Date Deposited: 02 Apr 2001 00:00
Last Modified: 12 Jan 2012 13:04
URI: http://e-archive.informatik.uni-koeln.de/id/eprint/363