Full-text resources of CEJSH and other databases are now available in the new Library of Science.
Visit https://bibliotekanauki.pl

Refine search results

Journals help

  1. 1 Operations Research and Decisions

Authors help

  1. 1 DRGAS-BURCHARDT E.

Years help

  1. 1 2015

Results found: 1

first rewind previous Page / 1 next fast forward last

Search results

Search:
in the keywords:  Gale–Shapley model
help Sort By:

help Limit search:
first rewind previous Page / 1 next fast forward last
1
Publication available in full text mode
Content available

The number of stable matchings in models of the Gale-Shapley type with preferences given by partial orders

100%
DRGAS-BURCHARDT E.
Operations Research and Decisions
|
2015
|
vol. 25
|
issue 1
5-15
EN
From the famous Gale–Shapley theorem we know that each classical marriage problem admits at least one stable matching. This fact has inspired researchers to search for the maximum number of possible stable matchings, which is equivalent to finding the minimum number of unstable matchings among all such problems of size n. In this paper, we deal with this issue for the Gale–Shapley model with preferences represented by arbitrary partial orders. Also, we discuss this model in the context of the classical Gale–Shapley model.
first rewind previous Page / 1 next fast forward last
JavaScript is turned off in your web browser. Turn it on to take full advantage of this site, then refresh the page.