3 citations · 6 across the 18 of their papers we have counts for
6 papers · 1 filter
Ex-post Stability under Two-Sided Matching: Complexity and Characterization
Haris Aziz, Gergely Csáji, Péter Biró
A probabilistic approach to the stable matching problem has been identified as an important research area with several important open problems. When considering random matchings, e…
Extending Stable and Popular Matching Algorithms from Bipartite to Arbitrary Instances
Gergely Csáji
We consider stable and popular matching problems in arbitrary graphs, which are referred to as stable roommates instances. We extend the 3/2-approximation algorithm for the maximum…
The NTU Partitioned Matching Game for International Kidney Exchange Programs
Gergely Csáji, Tamás Király, Zsuzsa Mészáros-Karkus
Motivated by the real-world problem of international kidney exchange (IKEP), recent literature introduced a generalized transferable utility matching game featuring a partition of…
Popular Maximum-Utility Matchings with Matroid Constraints
Gergely Csáji, Tamás Király, Kenjiro Takazawa +1
We investigate weighted settings of popular matching problems with matroid constraints. The concept of popularity was originally defined for matchings in bipartite graphs, where ve…
Popularity and Perfectness in One-sided Matching Markets with Capacities
Gergely Csáji
We consider many-to-one matching problems, where one side corresponds to applicants who have preferences and the other side to houses who do not have preferences. We consider two d…
Approximating maximum-size properly colored forests
Yuhang Bai, Kristóf Bérczi, Gergely Csáji +1
In the Properly Colored Spanning Tree problem, we are given an edge-colored undirected graph and the goal is to find a properly colored spanning tree, i.e., a spanning tree in whic…