3 citations · 6 across the 18 of their papers we have counts for
4 papers · 2 filters
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…
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…