Abstract
A matching game is a cooperative game (N,v) defined on a graph G = (N,E) with an edge weighting \(w: E\to {\mathbb R}_+\). The player set is N and the value of a coalition S ⊆ N is defined as the maximum weight of a matching in the subgraph induced by S. First we present an O(nm + n 2logn) 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 allocation if the core is nonempty. This improves previous work based on the ellipsoid method. Second we show that the nucleolus of an n-player matching game with nonempty core can be computed in O(n 4) time. This generalizes the corresponding result of Solymosi and Raghavan for assignment games. Third we show that determining an imputation with minimum number of blocking pairs is an NP-hard problem, even for matching games with unit edge weights.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abraham, D.J., Biró, P., Manlove, D.F.: “Almost stable” matchings in the Roommates problem. In: Erlebach, T., Persinao, G. (eds.) WAOA 2005. LNCS, vol. 3879, pp. 1–14. Springer, Heidelberg (2006)
Balinski, M.L.: Integer programming: Methods, uses, computation. Management Science 12, 253–313 (1965)
Bilbao, J.M.: Cooperative games on combinatorial structures. Kluwer Academic, Norwell (2000)
Biró, P.: The stable matching problem and its generalizations: an algorithmic and game theoretical approach, PhD Thesis, Budapest University of Technology and Economics, Budapest, Hungary (2007)
Deng, X., Ibaraki, T., Nagamochi, H.: Algorithmic aspects of the core of combinatorial optimization games. Math. Oper. Res. 24, 751–766 (1999)
Egerváry, J.: Matrixok kombinatorius tulajdonságairól. Matematikai és Fizikai Lapok 38, 16–28 (1931)
Eriksson, K., Karlander, J.: Stable outcomes of the roommate game with transferable utility. Internat. J. Game Theory 29, 555–569 (2001)
Faigle, U., Kern, W., Fekete, S., Hochstättler, W.: The nucleon of cooperative games and an algorithm for matching games. Math. Program. 83, 195–211 (1998)
Gabow, H.N.: Data structures for weighted matching and nearest common ancestors with linking. In: Proceedings of SODA 1990, pp. 434–443 (1990)
Garey, M.R., Johnson, D.S., Stockmeyer, L.: Some simplified NP-complete graph problems. Theoret. Comput. Sci. 1, 237–267 (1976)
Kern, W., Paulusma, D.: Matching games: the least core and the nucleolus. Math. Oper. Res. 28, 294–308 (2003)
Khachiyan, L.G.: A polynomial algorithm in linear programming. Soviet Mathematics Doklady 20, 191–194 (1979)
Klaus, B., Nichifor, A.: Consistency and monotonicity in one-sided assignment problems (2009) (preprint)
Maschler, M., Peleg, B., Shapley, L.S.: Geometric properties of the kernel, nucleolus, and related solution concepts. Math. Oper. Res. 4, 303–338 (1979)
Matsui, T.: A note on the nucleolus of assignment games. In: 5th International Conference on Nonlinear Analysis and Convex Analysis, pp. 253–260. World Scientific, Singapore (1998)
Micali, S., Vazirani, V.V.: An \(O(\sqrt{|V|} \cdot |E|)\) algorithm for finding maximum matching in general graphs. In: Proceedings of FOCS 1980, pp. 17–27 (1980)
Nemhauser, G.L., Trotter, L.E.: Vertex packings: structural properties and algorithms. Math. Program. 8, 232–248 (1975)
Owen, G.: Game theory. Academic Press, San Diego (1995)
Paulusma, D.: Complexity aspects of cooperative games, PhD Thesis, University of Twente, Enschede, the Netherlands (2001)
Schmeidler, D.: The nucleolus of a characteristic function game. SIAM J. Appl. Math. 17, 1163–1170 (1969)
Shapley, L.S., Shubik, M.: The assignment game I: the core. Internat. J. Game Theory 1, 111–130 (1972)
Schrijver, A.: Combinatorial optimization. In: Polyhedra and efficiency. Algorithms and Combinatorics 24, vol. A. Springer, Berlin (2003)
Solymosi, T., Raghavan, T.E.S.: An algorithm for finding the nucleolus of assignment games. Internat. J. Game Theory 23, 119–143 (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Biró, P., Kern, W., Paulusma, D. (2010). On Solution Concepts for Matching Games. In: Kratochvíl, J., Li, A., Fiala, J., Kolman, P. (eds) Theory and Applications of Models of Computation. TAMC 2010. Lecture Notes in Computer Science, vol 6108. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13562-0_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-13562-0_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13561-3
Online ISBN: 978-3-642-13562-0
eBook Packages: Computer ScienceComputer Science (R0)