Results 41 to 50 of about 963,583 (273)
An 8/5 approximation algorithm for a hard variant of stable marriage [PDF]
, 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., Manlove, D.F.
core +1 more source
Stable Matching With Incomplete Information
Econometrica, 2013 We formulate a notion of stable outcomes in matching problems with one-sided asymmetric information. The key conceptual problem is to formulate a notion of a blocking pair that takes account of the inferences that the uninformed agent might make. We show that the set of stable outcomes is nonempty in incomplete-information environments, and is a ...
Liu, Qingmin +3 more
openaire +4 more sources
Stability, Optimality and Manipulation in Matching Problems with Weighted Preferences
Algorithms, 2013 The stable matching problem (also known as 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.
Maria Silvia Pini +3 more
doaj +1 more source
Psychosocial Outcomes in Patients With Endocrine Tumor Syndromes: A Systematic Review
Pediatric Blood &Cancer, EarlyView.ABSTRACT Introduction The combination of disease manifestations, the familial burden, and varying penetrance of endocrine tumor syndromes (ETSs) is unique. This review aimed to portray and summarize available data on psychosocial outcomes in patients with ETSs and explore gaps and opportunities for future research and care.
Daniël Zwerus +6 more
wiley +1 more source
Polynomially tractable cases in the popular roommates problem
Journal of Mechanism and Institution DesignThe input of the popular roommates problem consists of a graph G = (V, E) and for each vertex v in V, strict preferences over the neighbors of v. Matching M is more popular than M' if the number of vertices preferring M to M' is larger than the number of
Erika Bérczi-Kovács +3 more
doaj +1 more source
Solving stable matching problems using answer set programming [PDF]
, 2015 Since the introduction of the stable marriage problem (SMP) by Gale and Shapley (1962), several variants and extensions have been investigated. While this variety is useful to widen the application potential, each variant requires a new algorithm for ...
De Clercq, Sofie +3 more
core +2 more sources
, 2009 We define the median stable matching for two-sided matching markets with side payments and prove constructively that it exists.
Michael Schwarz, M. Bumin Yenmez
openaire +2 more sources
Pediatric Blood &Cancer, EarlyView.ABSTRACT Ongoing evidence indicates increased risk of sarcopenic obesity among children and young people (CYP) with acute lymphoblastic leukemia (ALL), often beginning early in treatment, persisting into survivorship. This review evaluates current literature on body composition in CYP with ALL during and after treatment.
Lina A. Zahed +5 more
wiley +1 more source
Editorial: Special Issue on Matching under Preferences
Algorithms, 2014 This special issue of Algorithms is devoted to the study of matching problems involving ordinal preferences from the standpoint of algorithms and complexity.
Péter Biró, David F. Manlove
doaj +1 more source
Stable Noncrossing Matchings [PDF]
, 2019 This paper has appeared at IWOCA ...
Suthee Ruangwises, Toshiya Itoh
openaire +2 more sources