Results 41 to 50 of about 304,412 (273)
New and simple algorithms for stable flow problems [PDF]
, 2018 Stable flows generalize the well-known concept of stable matchings to markets in which transactions may involve several agents, forwarding flow from one to another.
A-T Gai +24 more
core +2 more sources
Complexity Study for the Robust Stable Marriage Problem [PDF]
Theoretical Computer Science, 2019 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Genc, Begum +3 more
openaire +2 more sources
Approximation algorithms for the sex-equal stable marriage problem [PDF]
ACM Transactions on Algorithms, 2007 The stable marriage problem is a classical matching problem introduced by Gale and Shapley. It is known that for any instance, there exists a solution, and there is a polynomial time algorithm to find one. However, the matching obtained by this algorithm is man-optimal, that is, the matching is favorable for men but unfavorable for women, (or, if we ...
Iwama, Kazuo +2 more
openaire +2 more sources
A Stable Marriage Requires Communication
, 2018 The Gale-Shapley algorithm for the Stable Marriage Problem is known to take $\Theta(n^2)$ steps to find a stable marriage in the worst case, but only $\Theta(n \log n)$ steps in the average case (with $n$ women and $n$ men).
Gonczarowski, Yannai A. +3 more
core +1 more source
Modeling Stable Matching Problems with Answer Set Programming [PDF]
, 2013 The Stable Marriage Problem (SMP) is a well-known matching problem first introduced and solved by Gale and Shapley (1962). Several variants and extensions to this problem have since been investigated to cover a wider set of applications.
A. Kato +14 more
core +3 more sources
Approximation algorithms for hard variants of the stable marriage and hospitals/residents problems [PDF]
, 2007 When ties and incomplete preference lists are permitted in the Stable Marriage and Hospitals/Residents problems, stable matchings can have different sizes.
AE Roth +20 more
core +2 more sources
Finding large stable matchings [PDF]
, 2009 When ties and incomplete preference lists are permitted in the stable marriage and hospitals/residents problems, stable matchings can have different sizes.
Biró P. +5 more
core +1 more source
Agribusiness, EarlyView.Abstract Nucleus outgrower schemes are contractual arrangements where well‐resourced large‐scale farmers (nucleus farmers) are empowered by development support agencies to take charge of smallholder farmers, by providing them with market access and the necessary training on agronomic practices and farm inputs for production.
Dominic Tasila Konja, Awudu Abdulai
wiley +1 more source
Lower bounds for the stable marriage problem and its variants [PDF]
, 1988 In an instance of the stable marriage problem of size n, n men and n women each ranks members of the opposite sex in order of preference. A stable marriage is a complete matching M = {(m_1, w_i_1), (m_2, w_i_2), ..., (m_n, w_i_n)} such that no unmatched ...
Hirschberg, Daniel S., Ng, Cheng
core
American Journal of Community Psychology, EarlyView.Abstract Although peer support is central to the social model approach emphasized in sober living houses (SLHs), no longitudinal studies have examined helping among SLH residents. This longitudinal study examined benefits of helping in three contexts among SLH residents. Data were from 205 participants entering 28 SLHs across 2021–2023. Interviews were
Sarah E. Zemore +4 more
wiley +1 more source