Matching games: the least core and the nucleolus


Kern, W. and Paulusma, D. (2000) Matching games: the least core and the nucleolus. [Report]

open access
Abstract:A matching game is a cooperative game defined by a graph $G=(V,E)$. The player set is $V$ and the value of a coalition $S \subseteq V$ 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.
Item Type:Report
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:
Export this item as:BibTeX
HTML Citation
Reference Manager


Repository Staff Only: item control page

Metis ID: 141197