Matching games: the least core and the nucleolus

Walter Kern, Daniël Paulusma

Research output: Contribution to journalArticleAcademicpeer-review

62 Citations (Scopus)

Abstract

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.
Original languageUndefined
Pages (from-to)294-308
Number of pages15
JournalMathematics of operations research
Volume28
Issue number2
DOIs
Publication statusPublished - 2003

Keywords

  • IR-98492
  • Computational Complexity
  • Cooperative games
  • Matching
  • Nucleolus
  • METIS-213432

Cite this