New research article in ACM Transactions on Economics and Computation by Gergely Csáji and co-authors

Computational Complexity of k -stable Matchings Haris Aziz, Gergely Csáji, Ágnes Cseh ACM Transactions on Economics and Computation,Volume 13 , Issue 1 Paper 5. 25 p. (2025) – March 2025 We study deviations by a group of agents in the three main types of matching markets: the house allocation, the marriage, and the roommates models. For a […]