3 papers
cs.GT2026
The Complexity of Minimizing Subsidies in Envy-Free House Allocation
Sijia Dai, Minming Li, Xiaowei Wu +1
The house allocation problem is a classical one-sided matching problem that concerns the assignment of a set of houses to agents according to their preferences, where each…
cs.CG2025
FPT Constant Approximation Algorithms for Colorful Sum of Radii
Shuilian Liu, Gregory Gutin, Yicheng Xu +1
We study the colorful sum of radii problem, where the input is a point set partitioned into classes , along with per-class outlier bounds $m_1, m_2, \dots…
cs.GT2024
Weighted Envy-Freeness in House Allocation
Sijia Dai, Yankai Chen, Xiaowei Wu +2
The classic house allocation problem involves assigning houses to agents based on their utility functions, ensuring each agent receives exactly one house. A key criterion i…