Matching Games: The Least Core and the Nucleolus

A matching game is a cooperative game defined by a graph G = (N, E). The player set is N and the value of a coalition S ⊆ N is defined as the size of a maximum matching in the subgraph induced by S. We show that the nucleolus of such games can be computed efficiently. The result is based on an alternative characterization of the least core, which may be of independent interest. The general case of weighted matching games remains unsolved.

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

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

[3]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

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

[5]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

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

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

[8]  L. Lovász.  Matching Theory (North-Holland mathematics studies) , 1986 .

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

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

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

[12]  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.

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

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

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

[16]  Daniel Granot,et al.  Characterization sets for the nucleolus , 1998, Int. J. Game Theory.

[17]  U. Faigle,et al.  An efficient algorithm for nucleolus and prekernel computation in some classes of TU-games , 1998 .

[18]  Toshihide Ibaraki,et al.  Algorithmic Aspects of the Core of Combinatorial Optimization Games , 1999, Math. Oper. Res..

[19]  Bernhard Korte,et al.  Combinatorial Optimization , 1992, NATO ASI Series.

[20]  Daniël Paulusma,et al.  Note on the computational complexity of least core concepts for min-cost spanning tree games , 2000, Math. Methods Oper. Res..

[21]  Kimmo Eriksson,et al.  Stable outcomes of the roommate game with transferable utility , 2000, Int. J. Game Theory.

[22]  Daniël Paulusma,et al.  Complexity aspects of cooperative games , 2001 .