Results 231 to 240 of about 7,398,457 (268)

Long-term Outcomes of Gender Decisions in Differences of Sex Development (DSD) from an Indian Perspective: A Multicenter Study. [PDF]

J Indian Assoc Pediatr Surg
Sharma S, Bendre PS, Rahul SK, Shah A, Kurbet SB, Babu R, Banerjee A, Keshri R, Shah A.   +8 more
europepmc   +1 more source

Research on the impact of economic stress on young adults' marital intentions from the perspective of social exchange theory: a study on the mediating role of psychological capital. [PDF]

Front Psychol
Liu J, Shao Y, Qiao Y, Xu F.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

The stable marriage problem

Communications of the ACM, 1971
The original work of Gale and Shapley on an assignment method using the stable marriage criterion has been extended to find all the stable marriage assignments. The algorithm derived for finding all the stable marriage assignments is proved to satisfy all the conditions of the problem. Algorithm 411 applies to this paper.
L B Wilson
exaly   +3 more sources

On the decomposability of the stable marriage problem

BIT Numerical Mathematics, 1989
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Eugene Veklerov
exaly   +2 more sources

Improved approximation results for the stable marriage problem

ACM Transactions on Algorithms, 2007
The stable marriage problem has recently been studied in its general setting, where both ties and incomplete lists are allowed. It is NP-hard to find a stable matching of maximum size, while any stable matching is a maximal matching and thus trivially we can obtain a 2-approximation algorithm.
Hiroki Yanagisawa, Magnus M Halldórsson, Shuichi Miyazaki   +2 more
exaly   +3 more sources

A Generalization of the Stable Marriage Problem

Journal of the Operational Research Society, 1981
In this paper we extend the results of Gale and Shapely on the stable marriage problem. The set of participants in an assignment configuration is allowed to expand dynamically as long as certain relative preference conditions are maintained. The impact of this extension on complexity and performance issues are discussed.
openaire   +2 more sources

Procedural fairness in stable marriage problems

International Joint Conference on Autonomous Agents and Multiagent Systems, 2011
The stable marriage problem is a well-known problem of matching men to women so that no man and woman, who are not married to each other, both prefer each other. It 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. Given a stable
M. Gelain, PINI, MARIA SILVIA, ROSSI, FRANCESCA, VENABLE, KRISTEN BRENT, T. Walsh   +4 more
openaire   +3 more sources

Inapproximability Results on Stable Marriage Problems

2002
The stable marriage problem has received considerable attention both due to its practical applications as well as its mathematical structure. While the original problem has all participants ranka ll members of the opposite sex in a strict order of preference, two natural variations are to allow for incomplete preference lists and ties in the ...
Magnús M. Halldórsson, Kazuo Iwama, Shuichi Miyazaki, Yasufumi Morita   +3 more
openaire   +2 more sources

A network visualization of stable matching in the stable marriage problem

Artificial Life and Robotics, 2011
The stable marriage problem (SMP) seeks matchings between n women and n men which would result in stability, and not lead to divorce or extramarital affairs. We have introduced a network consisting of nodes which represent matchings, and links between nodes which attain stability by exchanging a partner between two pairs.
Yoshihisa Morizumi, Tatsuya Hayashi, Yoshiteru Ishida   +2 more
openaire   +1 more source

A probabilistic version of the stable marriage problem

BIT, 1983
A new interpretation of the stable marriage problem posed by Gale and Shapley is presented. This approach enables one to solve efficiently this version of the assignment problem when it is known that the preference information is inaccurate or when there is a need to reduce the computational requirements of the problem.
openaire   +2 more sources