Results 41 to 50 of about 972,187 (291)
Social Choice and WelfareGale and Shapley introduced a matching problem between two sets of agents where each agent on one side has an exogenous preference ordering over the agents on the other side. They defined a matching as stable if no unmatched pair can both improve their utility by forming a new pair.
Felipe Garrido-Lucero, Rida Laraki
openaire +2 more sources
Constrainedness in Stable Matching
2018 IEEE 30th International Conference on Tools with Artificial Intelligence (ICTAI), 2018 In constraint satisfaction problems, constrainedness provides a way to predict the number of solutions: for instances of a same size, the number of constraints is inversely correlated with the number of solutions. However, there is no obvious equivalent metric for stable matching problems.
Escamocher, Guillaume, O'Sullivan, Barry
openaire +2 more sources
Tạp chí Khoa họcThis paper proposes an efficient depth-first search algorithm to solve the maximum stable marriage problem with ties and incomplete preference lists. The key idea of the algorithm is to initialize an empty matching and mark all men as unmatched.
Le Quoc Anh, Hoang Huu Viet +1 more
doaj +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
Pediatric Blood &Cancer, EarlyView.ABSTRACT Objective To evaluate selumetinib exposure using therapeutic drug monitoring (TDM) in pediatric patients with neurofibromatosis type 1 (NF1) and plexiform neurofibromas (PN), assess interpatient pharmacokinetic variability, and explore the relationship between drug exposure, clinical response, and adverse effects.
Janka Kovács +8 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
, 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
Intravitreal GD2‐Specific Chimeric Antigen Receptor T‐Cell Therapy for Refractory Retinoblastoma
Pediatric Blood &Cancer, EarlyView.ABSTRACT Effective treatments for advanced, treatment‐resistant retinoblastoma (RB) remain limited. GD2‐specific chimeric antigen receptor (CAR) T cells show potent antitumor activity with minimal toxicity but have not previously been evaluated in RB.
Subongkoch Subhadhirasakul +13 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