Algorithmic Aspects of Equilibria of Stable Marriage Model with Complete Preference Lists
Tomomi Matsui
Additional contact information
Tomomi Matsui: Chuo University
A chapter in Operations Research Proceedings 2010, 2011, pp 47-52 from Springer
Abstract:
Abstract Given two sets of agents, men and women, Gale and Shapley discussed a model, called the stable marriage model, in which each agent has a preference over agents of the opposite sex. Gale and Shapley showed that every set of preference lists admits at least one stable marriage by describing an algorithm, called the Gale-Shapley algorithm, which always finds a stable marriage. Given (true) preference lists of men over women and (true) preference lists of women over men, we introduce a game among women. In a play of the game, each woman chooses a strategy which corresponds to a complete preference list over men. The resulting payoff of a woman is her mate determined by men-proposing Gale-Shapley algorithm executed on men’s (true) preference lists and women’s joint strategy. We propose a polynomial time algorithm for checking whether a given marriage is an equilibrium outcome or not.
Keywords: Equilibrium Point; Polynomial Time Algorithm; Equilibrium Outcome; Preference List; Stable Marriage (search for similar items in EconPapers)
Date: 2011
References: Add references at CitEc
Citations:
There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:oprchp:978-3-642-20009-0_8
Ordering information: This item can be ordered from
http://www.springer.com/9783642200090
DOI: 10.1007/978-3-642-20009-0_8
Access Statistics for this chapter
More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().