research
∙
07/07/2023
Computational complexity of k-stable matchings
We study deviations by a group of agents in the three main types of matc...
share
research
∙
04/05/2023
A Simple 1.5-Approximation Algorithm for a Wide Range of Max-SMTI Problems
We give a simple approximation algorithm for a common generalization of ...
research
∙
02/03/2023
Optimal Capacity Modification for Many-To-One Matching Problems
We consider many-to-one matching problems, where one side consists of st...
research
∙
09/06/2022
Solving the Maximum Popular Matching Problem with Matroid Constraints
We consider the problem of finding a maximum popular matching in a many-...
research
∙
08/20/2022
Approximation Algorithms for Matroidal and Cardinal Generalizations of Stable Matching
The Stable Marriage problem (SM), solved by the famous deferred acceptan...
research
∙
06/23/2022
On the complexity of packing rainbow spanning trees
One of the most important questions in matroid optimization is to find d...
research
∙
04/28/2022
Manipulating the outcome of stable matching and roommates problems
The stable marriage and stable roommates problems have been extensively ...
research
∙
02/11/2022
