Matching games: The least core and the nucleolus

Matching games: The least core and the nucleolus

0.00 Avg rating0 Votes
Article ID: iaor2004355
Country: United States
Volume: 28
Issue: 2
Start Page Number: 294
End Page Number: 308
Publication Date: May 2003
Journal: Mathematics of Operations Research
Authors: ,
Keywords: graphs
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.

Reviews

Required fields are marked *. Your email address will not be published.