Kern, W. and Paulusma, Daniel (2003) 'Matching games : the least core and the nucleolus.', Mathematics of operations research., 28 (2). pp. 294-308.
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.
|Full text:||PDF - Published Version (154Kb)|
|Publisher Web site:||http://dx.doi.org/10.1287/moor.28.2.294.14477|
|Publisher statement:||© 2003 INFORMS|
|Record Created:||14 Mar 2007|
|Last Modified:||22 Sep 2014 11:00|
|Social bookmarking:||Export: EndNote, Zotero | BibTex|
|Usage statistics||Look up in GoogleScholar | Find in a UK Library|