Matching games: the least core and the nucleolus

Walter Kern, Daniël Paulusma

Research output: Book/ReportReportProfessional

201 Downloads (Pure)


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.
Original languageUndefined
Place of PublicationEnschede
PublisherUniversity of Twente, Department of Applied Mathematics
Number of pages18
Publication statusPublished - 2000

Publication series

NameMemorandum Faculteit TW
PublisherDepartment of Applied Mathematics, University of Twente
ISSN (Print)0169-2690


  • MSC-90C27
  • MSC-90D12
  • EWI-3361
  • IR-65728
  • METIS-141197

Cite this