1 citations · 1 across the 8 of their papers we have counts for
Showing cs.GTShow all
3 papers · 1 filter
cs.GT2022
Solving the Maximum Popular Matching Problem with Matroid Constraints
Gergely Csáji, Tamás Király, Yu Yokoi
We consider the problem of finding a maximum popular matching in a many-to-many matching setting with two-sided preferences and matroid constraints. This problem was proposed by Ka…
cs.GT2022
Maximum Stable Matching with Matroids and Partial Orders
Gergely Csáji, Tamás Király, Yu Yokoi
The Stable Marriage problem (SM), solved by the famous deferred acceptance algorithm of Gale and Shapley (GS), has many natural generalizations. If we allow ties in preferences, th…
cs.GT2022
Manipulating the outcome of stable matching and roommates problems
Kristóf Bérczi, Gergely Csáji, Tamás Király
The stable marriage and stable roommates problems have been extensively studied due to their high applicability in various real-world scenarios. However, it might happen that no st…