A Polynomial-Time Algorithm to Find von Neumann-Morgenstern Stable Matchings in Marriage Games
- 244 Downloads
This paper considers von Neumann-Morgenstern (vNM) stable sets in marriage games. Ehlers (Journal of Economic Theory 134: 537–547, 2007) showed that if a vNM stable set exists in a marriage game, the set is a maximal distributive lattice of matchings that includes all core matchings. To determine what matchings form a vNM stable set, we propose a polynomial-time algorithm that finds a man-optimal matching and a woman-optimal matching in a vNM stable set of a given marriage game. This algorithm also generates a modified preference profile such that a vNM stable set is obtained as the core of a marriage game with the modified preference profile. It is well known that cores of marriage games are nonempty. However, the nonemptiness of cores does not imply the existence of a vNM stable set. It is proved using our algorithm that there exists a unique vNM stable set for any marriage game.
KeywordsMatching problem Stable matching von Neumann-Morgenstern stable set
Unable to display preview. Download preview PDF.
- 8.Kesten, O.: School choice with consent. Discussion paper (2008). Q. J. Econ. (to appear) Google Scholar
- 9.Knuth, D.: Marriages Stables. Les Presses de l’Université de Montréal, Montreal (1976). [English edition, the American Mathematical Society, Providence, 1996] Google Scholar
- 17.Wako, J.: A note on existence and uniqueness of vNM stable sets marriage games. In: Match-UP Workshop Proceedings of ICALP 2008, pp. 157–168 (2008) Google Scholar