|
|||||
|
|
On the computation of the nucleolus of a cooperative game |
|
| Authors: | Ulrich Faigle Walter Kern Jeroen Kuipers |
| Institution: | Zentrum für Angewandte Informatik, Universit?t zu K?ln, Weyertal 80, 50931 K?ln, Germany. E-mail address: faigle@zpr.uni-koeln.de, DE Department of Applied Mathematics, University of Twente, P.O.Box 217, 7500 AE Enschede, The Netherlands. E-mail address: kern@math.utwente.nl, NL Department of Mathematics, Maastricht University, P.O.Box 616, 6200 MD Maastricht, The Netherlands. E-mail address: kuipers@math.unimaas.nl, NL |
| 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. Received February 2000/Final version April 2001 |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ | |