We use cookies to ensure that we give you the best experience on our website. By continuing to browse this repository, you give consent for essential cookies to be used. You can read more about our Privacy and Cookie Policy.

Durham Research Online
You are in:

Computing solutions for matching games.

Biro, P. and Kern, W. and Paulusma, Daniel (2012) 'Computing solutions for matching games.', International journal of game theory., 41 (1). pp. 75-90.


A matching game is a cooperative game (N, v) defined on a graph G = (N, E) with an edge weighting w: E® \mathbb R+w:ER+. The player set is N and the value of a coalition S Í NSN is defined as the maximum weight of a matching in the subgraph induced by S. First we present an O(nm + n 2 log n) algorithm that tests if the core of a matching game defined on a weighted graph with n vertices and m edges is nonempty and that computes a core member if the core is nonempty. This algorithm improves previous work based on the ellipsoid method and can also be used to compute stable solutions for instances of the stable roommates problem with payments. Second we show that the nucleolus of an n-player matching game with a nonempty core can be computed in O(n 4) time. This generalizes the corresponding result of Solymosi and Raghavan for assignment games. Third we prove that is NP-hard to determine an imputation with minimum number of blocking pairs, even for matching games with unit edge weights, whereas the problem of determining an imputation with minimum total blocking value is shown to be polynomial-time solvable for general matching games.

Item Type:Article
Keywords:Matching game, Nucleolus, Cooperative game theory.
Full text:(AM) Accepted Manuscript
Download PDF
Publisher Web site:
Publisher statement:The original publication is available at
Date accepted:No date available
Date deposited:29 March 2012
Date of first online publication:February 2012
Date first made open access:No date available

Save or Share this output

Look up in GoogleScholar