Results 31 to 40 of about 2,017,974 (284)

On the Complexity of Robust Stable Marriage [PDF]

open access: yes, 2017
Accepted for publication in COCOA ...
Genc, Begum   +3 more
openaire   +5 more sources

Local Search Approaches in Stable Matching Problems

open access: yesAlgorithms, 2013
The stable marriage (SM) problem has a wide variety of practical applications, ranging from matching resident doctors to hospitals, to matching students to schools or, more generally, to any two-sided market.
Toby Walsh   +4 more
doaj   +1 more source

An 8/5 approximation algorithm for a hard variant of stable marriage [PDF]

open access: yes, 2007
When ties and incomplete preference lists are permitted in the Stable Marriage problem, stable matchings can have different sizes. The problem of finding a maximum cardinality stable matching in this context is NP-hard, even under very severe ...
Irving, R.W.   +3 more
core   +1 more source

Marriage Formation in Context: Four Decades in Comparative Perspective

open access: yesSocial Sciences, 2017
Marriage formation is deeply embedded in societal context. This study documents trends towards lower marriage rates and delayed marriage in Europe and the US.
Claudia Geist
doaj   +1 more source

The Durability of First Marriages among Divorced Women With and Without Children: A Frailty Survival Model Approach [PDF]

open access: yesتداوم و تغییر اجتماعی
Background and Aim: A successful and stable marriage enhances the health and well-being of individuals. The children’s presence in a family, in addition to being couples’s special asset and investment, can play a significant role in reducing divorce ...
Arezoo Bagheri
doaj   +1 more source

Approximation algorithms for hard variants of the stable marriage and hospitals/residents problems [PDF]

open access: yes, 2007
When ties and incomplete preference lists are permitted in the Stable Marriage and Hospitals/Residents problems, stable matchings can have different sizes.
Irving, R.W.   +3 more
core   +1 more source

Adaptive stable marriage algorithms [PDF]

open access: yesProceedings of the 48th Annual Southeast Regional Conference, 2010
Although it takes O(n2) worst-case time to solve a stable marriage problem instance with n men and n women, a trivial O(n) algorithm suffices if all men are known to have identical preference lists and all women also are known to have identical preference lists.
John Dabney, Brian C. Dean
openaire   +1 more source

Fertility timing and the birth squeeze [PDF]

open access: yesDemographic Research
OBJECTIVE: To provide an in-depth examination of the birth squeeze, the alteration of male and female birth rates by the age-sex composition of the population.
Robert Schoen
doaj   +1 more source

Taxi Dispatching and Stable Marriage

open access: yesProcedia Computer Science, 2016
AbstractThis study explores the challenge of the dynamic dispatching of taxis to the immediate passenger booking requests. In particular, the study leverages on a stable marriage assignment algorithm and applies it for dispatching taxis to passengers.
Michal Kümmel   +2 more
openaire   +2 more sources

Stable marriage with ties and bounded length preference lists [PDF]

open access: yes, 2009
We consider variants of the classical stable marriage problem in which preference lists may contain ties, and may be of bounded length. Such restrictions arise naturally in practical applications, such as centralised matching schemes that assign ...
Irving, R.W.   +5 more
core   +1 more source

Home - About - Disclaimer - Privacy