93 citations · 155 across the 32 of their papers we have counts for
6 papers · 1 filter
On the Existence of EFX (and Pareto-Optimal) Allocations for Binary Chores
Biaoshuai Tao, Xiaowei Wu, Ziqi Yu +1
We study the problem of allocating a group of indivisible chores among agents while each chore has a binary marginal. We focus on the fairness criteria of envy-freeness up to any i…
One Quarter Each (on Average) Ensures Proportionality
Xiaowei Wu, Cong Zhang, Shengwei Zhou
We consider the problem of fair allocation of indivisible items to a group of agents with subsidy (money). Our work mainly focuses on the allocation of chores but most of o…
Improved Competitive Ratios for Online Bipartite Matching on Degree Bounded Graphs
Yilong Feng, Xiaowei Wu, Shengwei Zhou
We consider the online bipartite matching problem on -bounded graphs, where each online vertex has at most neighbors, each offline vertex has at least neighbors, and…
Multi-agent Online Scheduling: MMS Allocations for Indivisible Items
Shengwei Zhou, Rufan Bai, Xiaowei Wu
We consider the problem of fairly allocating a sequence of indivisible items that arrive online in an arbitrary order to a group of n agents with additive normalized valuation func…
Improved Competitive Ratio for Edge-Weighted Online Stochastic Matching
Yilong Feng, Guoliang Qiu, Xiaowei Wu +1
We consider the edge-weighted online stochastic matching problem, in which an edge-weighted bipartite graph G=(I\cup J, E) with offline vertices J and online vertex types I is give…
Weighted EF1 Allocations for Indivisible Chores
Xiaowei Wu, Cong Zhang, Shengwei Zhou
We study how to fairly allocate a set of indivisible chores to a group of agents, where each agent has a non-negative weight that represents its obligation for undertakin…