5 papers
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…
Fair Division by Contribution: A Shapley Value Perspective
Xiaohui Bei, Pinyan Lu, Xiaowei Wu +1
In many resource allocation problems, agents' valuations are best interpreted not as subjective preferences, but as the value they generate from receiving resources. Such valuation…
Online Matching with KIID Edge Arrivals
Yilong Feng, Haolong Li, Xiaowei Wu
In the classic online stochastic matching proposed by Feldman et al. (FOCS 2009), there is a known bipartite type-graph, where one side of the graph is given offline. Upon the arri…
Proportional and Pareto-Optimal Allocation of Chores with Subsidy
Jugal Garg, Eklavya Sharma, Xiaowei Wu
We consider the problem of allocating indivisible chores among agents with possibly different weights, aiming for a solution that is both fair and efficient. Specifically,…
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…