论文信息 - Characterization sets for the nucleolus

Characterization sets for the nucleolus

Abstract. We introduce the concept of a characterization set for the nucleolus of a cooperative game and develop sufficient conditions for a collection of coalitions to form a characterization set thereof. Further, we formalize Kopelowitz's method for computing the nucleolus through the notion of a sequential LP process, and derive a general relationship between the size of a characterization set and the complexity of computing the nucleolus.

[1] Theo Driessen,et al. A survey on minimum cost spanning tree games , 1991 .

[2] E. Kohlberg. On the Nucleolus of a Characteristic Function Game , 1971 .

[3] L. Shapley,et al. The assignment game I: The core , 1971 .

[4] S. C. Littlechild,et al. Aircraft Landing Fees: A Game Theory Approach , 1977 .

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

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

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

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

[9] L. Shapley. Cores of convex games , 1971 .

[10] S. C. Littlechild,et al. A further note on the nucleoous of the “airport game” , 1976 .

[11] J. H. Reijnierse. Games, graphs and algorithms , 1995 .

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

[13] Éva Tardos,et al. A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs , 1986, Oper. Res..

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