International Journal of Game Theory

, Volume 41, Issue 1, pp 75–90 | Cite as

Computing solutions for matching games

Article

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 \subseteq N}\) is defined 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.

Keywords

Matching game Nucleolus Cooperative game theory 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abraham DJ, Biró P, Manlove DF (2006) “Almost stable” matchings in the roommates problem. In: Proceedings of WAOA 2005: the 3rd workshop on approximation and online algorithms. Lecture Notes in Computer Science, vol 3879. pp 1–14Google Scholar
  2. Balinski ML (1965) Integer programming: methods, uses, computation. Manag Sci 12: 253–313CrossRefGoogle Scholar
  3. Bilbao JM (2000) Cooperative games on combinatorial structures. Kluwer Academic, NorwellCrossRefGoogle Scholar
  4. Biró P (2007) The stable matching problem and its generalizations: an algorithmic and game theoretical approach. PhD Thesis, Budapest University of Technology and Economics, BudapestGoogle Scholar
  5. Deng X, Ibaraki T, Nagamochi H (1999) Algorithmic aspects of the core of combinatorial optimization games. Math Oper Res 24: 751–766CrossRefGoogle Scholar
  6. Egerváry J (1931) Matrixok kombinatorius tulajdonságairól. Matematikai és Fizikai Lapok 38: 16–28Google Scholar
  7. Eriksson K, Karlander J (2001) Stable outcomes of the roommate game with transferable utility. Int J Game Theory 29: 555–569CrossRefGoogle Scholar
  8. Faigle U, Kern W, Fekete S, Hochstättler W (1998) The nucleon of cooperative games and an algorithm for matching games. Math Program 83: 195–211Google Scholar
  9. Faigle U, Kern W, Kuipers J (2001) On the computation of the nucleolus of a cooperative game. Int J Game Theory 30: 79–98CrossRefGoogle Scholar
  10. Gabow HN (1990) Data structures for weighted matching and nearest common ancestors with linking. In: Proceedings of SODA 1990: the 1st annual ACM-SIAM symposium on discrete algorithms, pp 434–443Google Scholar
  11. Garey MR, Johnson DS, Stockmeyer L (1976) Some simplified NP-complete graph problems. Theor Comput Sci 1: 237–267CrossRefGoogle Scholar
  12. Kern W, Paulusma D (2003) Matching games: the least core and the nucleolus. Math Oper Res 28: 294–308CrossRefGoogle Scholar
  13. Khachiyan LG (1979) A polynomial algorithm in linear programming. Sov Math Dokl 20: 191–194Google Scholar
  14. Klaus B, Nichifor A (2010) Consistency for one-sided assignment problems. Soc Choice Welf 35: 415–433CrossRefGoogle Scholar
  15. Maschler M, Peleg B, Shapley LS (1979) Geometric properties of the kernel, nucleolus, nd related solution concepts. Math Oper Res 4: 303–338CrossRefGoogle Scholar
  16. Matsui T (1998) A note on the nucleolus of assignment games, In: 5th International conference on nonlinear analysis and convex analysis. World Scientific, Singapore, pp 253–260Google Scholar
  17. Micali S, Vazirani VV (1980) An \({O(\sqrt{|V|}\,\cdot\,|E|)}\) algorithm for finding maximum matching in general graphs. In: Proceedings of FOCS 1980: the 21st annual symposium on foundations of computer science, pp 17–27Google Scholar
  18. Nemhauser GL, Trotter LE (1975) Vertex packings: structural properties and algorithms. Math Program 8: 232–248CrossRefGoogle Scholar
  19. Owen G (1995) Game theory. Academic Press, San DiegoGoogle Scholar
  20. Paulusma D (2001) Complexity aspects of cooperative games. PhD Thesis, University of Twente, EnschedeGoogle Scholar
  21. Schmeidler D (1969) The nucleolus of a characteristic function game. SIAM J Appl Math 17: 1163–1170CrossRefGoogle Scholar
  22. Schrijver A (2003) Combinatorial optimization. Polyhedra and efficiency, vol A, algorithms and combinatorics, vol 24. Springer-Verlag, BerlinGoogle Scholar
  23. Shapley LS, Shubik M (1971) The assignment game I: the core. Int J Game Theory 1: 111–130CrossRefGoogle Scholar
  24. Solymosi T, Raghavan TES (1994) An algorithm for finding the nucleolus of assignment games. Int J Game Theory 23: 119–143CrossRefGoogle Scholar

Copyright information

© Springer-Verlag 2011

Authors and Affiliations

  1. 1.Institute of Economics, Hungarian Academy of SciencesBudapestHungary
  2. 2.Faculty of Electrical Engineering, Mathematics and Computer ScienceUniversity of TwenteEnschedeThe Netherlands
  3. 3.Department of Computer ScienceUniversity of Durham, Science LaboratoriesDurhamEngland

Personalised recommendations