Algorithmics of Matching Under Preferences

By David F. Manlove. Bull. EATCS, 2013

571 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Economics and Econometrics, Management Science and Operations Research

View Paper: https://www.semanticscholar.org/paper/662bd1b1ea6e22dfbb337264fb6da33544d9902f

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. Merouane Debbah
2. Zhu Han
3. Walid Saad
4. Medhi Bennis

In Economics and Econometrics

1. Walid Saad
2. Merouane Debbah
3. Zhu Han
4. Medhi Bennis

In Management Science and Operations Research

1. Walid Saad
2. Merouane Debbah
3. Zhu Han
4. Medhi Bennis

Citations in the corpus

• Matching theory for future wireless networks: fundamentals and applications (2014, background): “The complexity of this iterative process depends on the total number of acceptable pairs m, which is O(m) [8].”
• User-Centric Cell-Free Massive MIMO Networks: A Survey of Opportunities, Challenges and Solutions (2021, background): “Matching problems involving preferences can be also studied [251], where the notation of optimality can be related to the preference included in the problem.”