Computing Solutions for Matching Games
A matching game is a cooperative game (N; v) defined on a graph G = (N;E) with an edge weighting w : E ! R+. The player set is N and the value of a coalition S N is de ned as the maximum weight of a matching in the subgraph induced by S. First we present an O(nm+n2 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(n4) 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.
|Date of creation:||Dec 2011|
|Date of revision:|
|Contact details of provider:|| Postal: 1112 Budapest, Budaorsi ut 45.|
Phone: (+36-1) 309-2652
Fax: (36-1) 319-3136
Web page: http://econ.core.hu
More information through EDIRC
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Jeroen Kuipers & Ulrich Faigle & Walter Kern, 2001. "On the computation of the nucleolus of a cooperative game," International Journal of Game Theory, Springer;Game Theory Society, vol. 30(1), pages 79-98.
- Johan Karlander & Kimmo Eriksson, 2001. "Stable outcomes of the roommate game with transferable utility," International Journal of Game Theory, Springer;Game Theory Society, vol. 29(4), pages 555-569.
- M. L. Balinski, 1965. "Integer Programming: Methods, Uses, Computations," Management Science, INFORMS, vol. 12(3), pages 253-313, November.
- Solymosi, Tamas & Raghavan, Tirukkannamangai E S, 1994. "An Algorithm for Finding the Nucleolus of Asignment Games," International Journal of Game Theory, Springer;Game Theory Society, vol. 23(2), pages 119-43.
- Bettina Klaus & Alexandru Nichifor, 2010. "Consistency in one-sided assignment problems," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 35(3), pages 415-433, September.
When requesting a correction, please mention this item's handle: RePEc:has:discpr:1142. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Adrienn Foldi)
If references are entirely missing, you can add them using this form.