1 citations · 1 across the 3 of their papers we have counts for
3 papers
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…
cs.GT2022
Strong core and Pareto-optimal solutions for the multiple partners matching problem under lexicographic preferences
Péter Biró, Gergely Csáji
In a multiple partners matching problem the agents can have multiple partners up to their capacities. In this paper we consider both the two-sided many-to-many stable matching prob…
quant-ph2021★ 1 cited
A new quantum algorithm for the hidden shift problem in
Gergely Csáji
In this paper we make a step towards a time and space efficient algorithm for the hidden shift problem for groups of the form . We give a solution to the case when…