In mathematics, economics, and computer science, the stable marriage problem (also stable matching problem or SMP) is the problem of finding a stable… (More)

Semantic Scholar uses AI to extract papers important to this topic.

2008

2008

- Zoltán Király
- Algorithmica
- 2008

We first consider the problem of finding a maximum size stable matching if incomplete lists and ties are both allowed, but ties… (More)

Is this relevant?

2006

2006

- Brian C. Dean, Michel X. Goemans, Nicole Immorlica
- IFIP TCS
- 2006

The Gale-Shapley “propose/reject” algorithm is a wellknown procedure for solving the classical stable marriage problem. In this… (More)

Is this relevant?

2005

2005

The Stable Marriage Problem is a combinatorial problem which can be solved by a centralized algorithm in polynomial time. This… (More)

Is this relevant?

2005

2005

- Katarína Cechlárová, David Manlove
- Discrete Applied Mathematics
- 2005

In this paper we consider instances of stable matching problems, namely the classical Stable Marriage (SM) and Stable Roommates… (More)

Is this relevant?

2003

2003

- Vânia M. F. Dias, Guilherme Dias da Fonseca, Celina M. H. de Figueiredo, Jayme Luiz Szwarcfiter
- Theor. Comput. Sci.
- 2003

A stable matching is a complete matching of men and women such that no man and woman who are not partners both prefer each other… (More)

Is this relevant?

2003

2003

The stable marriage problem has recently been studied in its general setting, where both ties and incomplete lists are allowed… (More)

Is this relevant?

Highly Cited

1999

Highly Cited

1999

- Chung-Piaw Teo, Jay Sethuraman, Wee-Peng Tan
- IPCO
- 1999

This paper is motivated by a study of the mechanism used to assign primary school students in Singapore to secondary schools. The… (More)

Is this relevant?

Highly Cited

1989

Highly Cited

1989

- Dan Gusfield, Robert W. Irving
- Foundations of computing series
- 1989

Where you can find the the stable marriage problem structure and algorithms easily? Is it in the book store? On-line book store… (More)

Is this relevant?

1989

1989

- Robert W. Irving
- 1989

We study a variant of the classical stable marriage problem in which there is an additional requirement for a stable matching… (More)

Is this relevant?

Highly Cited

1971

Highly Cited

1971

- D. G. McVitie, L. B. Wilson
- Commun. ACM
- 1971

The original work of Gale and Shapley on an assignment method using the stable marriage criterion has been extended to find all… (More)

Is this relevant?