Matching through institutions

Bloch, Francis; Cantala, David; Gibaja, Damián

doi:10.1016/j.geb.2020.01.010

Cited by 8 publications

(13 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The problem is relevant to applications as well, as shown by the papers of Cui and Jia [12], Raveendran et al [38], and Ma et al [30], who all studied 3D-cyclic stable matchings in the context of computer networks, as well as by the work of Bloch et al [7], who applied it to a Paris apartment assignment problem. Additionally, Escamocher and O'Sullivan [15] set up constraint programming models for the problem.…”

Section: Stability In 3 Dimensionsmentioning

confidence: 99%

“…Our last optimality concept relies on a recent real application, described by Bloch et al [7] who analyzed the Paris public housing market. In their work, A consists of various housing institutions such as the Ministry of Housing, B is the set of households looking for an apartment, and finally, C contains the social housing apartments that are to be assigned to these households.…”

Section: A∪b-popularitymentioning

confidence: 99%

“…Here we will study a restricted variant, listed as one of the three most typical interpretations of the institutions' preferences by Bloch et al [7]: institutions have preferences directly over the households, no matter which apartment they are matched to. This problem setting translates into a 3-dimensional matching instance, where agents in C only have the constraint to be matched to an acceptable agent from A, while classes A and B submit preferences over acceptable agents in classes B and C, respectively.…”

Section: A∪b-popularitymentioning

confidence: 99%

“…This problem setting translates into a 3-dimensional matching instance, where agents in C only have the constraint to be matched to an acceptable agent from A, while classes A and B submit preferences over acceptable agents in classes B and C, respectively. While Bloch et al [7] focused on the existence of a Pareto optimal solution, here we define popularity for such instances.…”

Section: A∪b-popularitymentioning

confidence: 99%

See 3 more Smart Citations

Three-Dimensional Popular Matching with Cyclic Preferences

Cseh¹,

Peters²

2021

Preprint

View full text Add to dashboard Cite

Two actively researched problem settings in matchings under preferences are popular matchings and the three-dimensional stable matching problem with cyclic preferences. In this paper, we apply the optimality notion of the first topic to the input characteristics of the second one. We investigate the connection between stability, popularity, and their strict variants, strong stability and strong popularity in three-dimensional instances with cyclic preferences. Furthermore, we also derive results on the complexity of these problems when the preferences are derived from master lists.

show abstract

Section: Stability In 3 Dimensionsmentioning

confidence: 99%

Section: A∪b-popularitymentioning

confidence: 99%

Section: A∪b-popularitymentioning

confidence: 99%

Section: A∪b-popularitymentioning

confidence: 99%

See 2 more Smart Citations

Three-Dimensional Popular Matching with Cyclic Preferences

Cseh¹,

Peters²

2021

Preprint

View full text Add to dashboard Cite

show abstract

“…In our application of allocating mentors to students we can observe a dynamic nature, so the literature on online matching is also related. Natural applications for online matching with preferences are deceased organ allocation [25], [3], allocation in social housing [23], [14], electric vehicle charging [20], or lending decisions [28].…”

Section: Related Literaturementioning

confidence: 99%

Online voluntary mentoring: Optimising the assignment of students and mentors

Bíró¹,

Gyetvai²

2021

Preprint

View full text Add to dashboard Cite

After the closure of the schools in Hungary from March 2020 due to the pandemic, many students were left at home with no or not enough parental help for studying, and in the meantime some people had more free time and willingness to help others in need during the lockdown. In this paper we describe the optimisation aspects of a joint NGO project for allocating voluntary mentors to students using a web-based coordination mechanism. The goal of the project has been to form optimal pairs and study groups by taking into the preferences and the constraints of the participants. In this paper we present the optimisation concept, and the integer programming techniques used for solving the allocation problems. Furthermore, we conducted computation simulations on real and generated data for evaluate the performance of this dynamic matching scheme under different parameter settings.

show abstract

Disaster Risk Reduction in Mexico

Sánchez‐Partida¹,

Martínez‐Flores²,

Caballero‐Morales³

et al. 2021

View full text Add to dashboard Cite

translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilms or in any other physical way, and transmission or information storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now known or hereafter developed. The use of general descriptive names, registered names, trademarks, service marks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use. The publisher, the authors and the editors are safe to assume that the advice and information in this book are believed to be true and accurate at the date of publication. Neither the publisher nor the authors or the editors give a warranty, expressed or implied, with respect to the material contained herein or for any errors or omissions that may have been made. The publisher remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

show abstract

Matching through institutions

Cited by 8 publications

References 29 publications

Three-Dimensional Popular Matching with Cyclic Preferences

Three-Dimensional Popular Matching with Cyclic Preferences

Online voluntary mentoring: Optimising the assignment of students and mentors

Disaster Risk Reduction in Mexico

Contact Info

Product

Resources

About