Matching games : the least core and the nucleolus

Kern, W.; Paulusma, D.

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 # 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.

Citation

Kern, W., & Paulusma, D. (2003). Matching games : the least core and the nucleolus. Mathematics of Operations Research, 28(2), 294-308. https://doi.org/10.1287/moor.28.2.294.14477

• Journal Article Type: Article
• Publication Date: May 1, 2003
• Deposit Date: Mar 14, 2007
• Publicly Available Date: Sep 22, 2014
• Journal: Mathematics of Operations Research
• Print ISSN: 0364-765X
• Electronic ISSN: 1526-5471
• Publisher: Institute for Operations Research and Management Sciences
• Peer Reviewed: Peer Reviewed
• Volume: 28
• Issue: 2
• Pages: 294-308
• DOI: https://doi.org/10.1287/moor.28.2.294.14477
• Public URL: https://durham-repository.worktribe.com/output/1600344