Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Matching Games: The Least Core and the Nucleolus

Matching Games: The Least Core and the Nucleolus 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Mathematics of Operations Research INFORMS

Matching Games: The Least Core and the Nucleolus

Mathematics of Operations Research , Volume 28 (2): 15 – May 21, 2003
15 pages

Loading next page...
 
/lp/informs/matching-games-the-least-core-and-the-nucleolus-wT9GAzK0Wm

References (24)

Publisher
INFORMS
Copyright
Copyright © INFORMS
Subject
Research Article
ISSN
0364-765X
eISSN
1526-5471
DOI
10.1287/moor.28.2.294.14477
Publisher site
See Article on Publisher Site

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.

Journal

Mathematics of Operations ResearchINFORMS

Published: May 21, 2003

Keywords: Keywords : Cooperative games ; nucleolus ; computational complexity ; matching

There are no references for this article.