Stable matching is a concept primarily found in the field of game theory and economics, particularly in the context of matching markets. It refers to a situation where members of two different sets (commonly referred to as "agents") are paired in a way that no two individuals would prefer to be matched with each other over their current partners. This concept was popularized by the Gale-Shapley algorithm, which was introduced in their seminal paper "College Admissions and the Stability of Marriage" in 1962.
New to topics? Read the docs here!