- Combinatorics
- >
- Graph theory
- >
- Matching (graph theory)
- >
- Stable matching

- Discrete mathematics
- >
- Graph theory
- >
- Matching (graph theory)
- >
- Stable matching

- Fields of mathematics
- >
- Graph theory
- >
- Matching (graph theory)
- >
- Stable matching

- Mathematical relations
- >
- Graph theory
- >
- Matching (graph theory)
- >
- Stable matching

- Theoretical computer science
- >
- Graph theory
- >
- Matching (graph theory)
- >
- Stable matching

Gale–Shapley algorithm

In mathematics, economics, and computer science, the Gale–Shapley algorithm (also known as the deferred acceptance algorithm or propose-and-reject algorithm) is an algorithm for finding a solution to

Rural hospitals theorem

The rural hospitals theorem (RHT) is a fundamental theorem in the theory of stable matching.It considers the problem of matching doctors to hospitals for residency, where each doctor is matched to a s

National Resident Matching Program

The National Resident Matching Program (NRMP), also called The Match, is a United States-based private non-profit non-governmental organization created in 1952 to place U.S. medical school students in

National Matching Service

National Matching Services (NMS) specializes in the development and administration of Matching Programs. NMS was founded in 1985, after developing sophisticated matching algorithms and software for th

No-justified-envy matching

In economics and social choice theory, a no-justified-envy matching is a matching in a two-sided market, in which no agent prefers the assignment of another agent and is simultaneously preferred by th

Envy-free matching

In economics and social choice theory, an envy-free matching (EFM) is a matching between people to "things", which is envy-free in the sense that no person would like to switch his "thing" with that o

Marriage Pact

The Marriage Pact is an unofficial yearly matching activity that takes place on American college campuses, by which students fill out compatibility surveys in order to find a partner among fellow part

Stable marriage problem

In mathematics, economics, and computer science, the stable marriage problem (also stable matching problem or SMP) is the problem of finding a stable matching between two equally sized sets of element

Stable marriage with indifference

Stable marriage with indifference is a variant of the stable marriage problem. Like in the original problem, the goal is to match all men to all women such that no pair of man and woman who are unmarr

Stable roommates problem

In mathematics, economics and computer science, particularly in the fields of combinatorics, game theory and algorithms, the stable-roommate problem (SRP) is the problem of finding a stable matching f

Two-Sided Matching

Two-Sided Matching: A Study in Game-Theoretic Modeling and Analysis is a book on matching markets in economics and game theory, particularly concentrating on the stable marriage problem. It was writte

Lattice of stable matchings

In mathematics, economics, and computer science, the lattice of stable matchings is a distributive lattice whose elements are stable matchings. For a given instance of the stable matching problem, thi

Stable matching polytope

In mathematics, economics, and computer science, the stable matching polytope or stable marriage polytope is a convex polytope derived from the solutions to an instance of the stable matching problem.

© 2023 Useful Links.