6 papers
Auction-based allocation of routes in capacity-constrained networks
Gergely Csáji, Dávid Csercsik
We study the route-set allocation problem between end nodes in capacity-constrained flow networks with transfer costs. We introduce an origin--destination (OD) bidding language, in…
Fairness and Non-wastefulness in Matching with Siblings and Initial Enrollments: Compatibility and Complexity
Haris Aziz, Gergely Csáji, Zhaohong Sun +1
We study a two-sided matching problem between families and daycare centers in which a family may have multiple children with joint preferences, and some children may already be enr…
Maximally Diverse Stable Matchings: Optimizing Arbitrary Institutional Objectives
Gergely Csáji, Zhaohong Sun
Stable matching provides the theoretical foundation for many centralized market mechanisms. However, modern matching markets often require additional distributional objectives, suc…
Optimal Portfolio Compression for Priority-Proportional Clearing with Defaulting Costs
Gergely Csáji, Rareş-Ioan Mateiu, Alexandru Popa +1
We study financial networks where banks are connected through bilateral liabilities and may default when resources are insufficient to meet obligations. We consider both the standa…
Core-Stable Kidney Exchange via Altruistic Donors
Gergely Csáji, Thánh Nguyen
Kidney exchange creates gains by pooling patient-donor pairs across hospitals and countries, but cooperation may unravel when coalitions can profitably withdraw. We introduce the s…
Smart Lotteries in School Choice: Ex-ante Pareto-Improvement with Ex-post Stability
Haris Aziz, Péter Biró, Gergely Csáji +1
In school choice, students typically have strict preferences over the schools while the schools have coarse priorities over the students based on their distance and their enrolled…