On the computation of the nucleolus of a cooperative game

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.

[1]  Sándor P. Fekete,et al.  On the complexity of testing membership in the core of min-cost spanning tree games , 1997, Int. J. Game Theory.

[2]  Daniel Granot,et al.  Computational Complexity of a Cost Allocation Approach to a Fixed Cost Spanning Forest Problem , 1992, Math. Oper. Res..

[3]  Daniel Granot,et al.  Minimum cost spanning tree games , 1981, Math. Program..

[4]  L. S. Shapley,et al.  Geometric Properties of the Kernel, Nucleolus, and Related Solution Concepts , 1979, Math. Oper. Res..

[5]  Martin Grötschel,et al.  The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..

[6]  Xiaotie Deng,et al.  On the Complexity of Cooperative Solution Concepts , 1994, Math. Oper. Res..

[7]  Daniel Granot,et al.  On the core and nucleolus of minimum cost spanning tree games , 1984, Math. Program..

[8]  T. Raghavan,et al.  An algorithm for finding the nucleolus of assignment games , 1994 .

[9]  C. G. Bird,et al.  On cost allocation for a spanning tree: A game theoretic approach , 1976, Networks.

[10]  G. Owen,et al.  The kernel/nucleolus of a standard tree game , 1996 .

[11]  Xiaotie Deng.  Combinatorial optimization games , 1997, SODA '97.

[12]  Jeroen Kuipers,et al.  Computing the nucleolus of some combinatorially-structured games , 2000, Math. Program..

[13]  L. Lovász,et al.  Geometric Algorithms and Combinatorial Optimization , 1981 .

[14]  D. Schmeidler.  The Nucleolus of a Characteristic Function Game , 1969 .

[15]  R. Stearns.  Convergent transfer schemes for $N$-person games , 1968 .

[16]  J. G. Pierce,et al.  Geometric Algorithms and Combinatorial Optimization , 2016 .

[17]  Sándor P. Fekete,et al.  The nucleon of cooperative games and an algorithm for matching games , 1998, Math. Program..

[18]  L. Shapley,et al.  The kernel and bargaining set for convex games , 1971 .

[19]  Nimrod Megiddo,et al.  Computational Complexity of the Game Theory Approach to Cost Allocation for a Tree , 1978, Math. Oper. Res..

[20]  Jeroen Kuipers,et al.  Note Computing the nucleolus of min-cost spanning tree games is NP-hard , 1998, Int. J. Game Theory.