2 citations · 2 across the 6 of their papers we have counts for
Showing 2025Show all
3 papers · 1 filter
cs.DS2025
Degree-bounded Online Bipartite Matching: OCS vs. Ranking
Yilong Feng, Haolong Li, Xiaowei Wu +1
We revisit the online bipartite matching problem on -regular graphs, for which Cohen and Wajc (SODA 2018) proposed an algorithm with a competitive ratio of $1-2\sqrt{H_d/d} = 1-…
cs.GT2025
When is Truthfully Allocating Chores no Harder than Goods?
Bo Li, Biaoshuai Tao, Fangxiao Wang +3
We study the problem of fairly and efficiently allocating a set of items among strategic agents with additive valuations, where items are either all indivisible or all divisible. W…
cs.GT2025
Approximately EFX and PO Allocations for Bivalued Chores
Zehan Lin, Xiaowei Wu, Shengwei Zhou
We consider the computation for allocations of indivisible chores that are approximately EFX and Pareto optimal (PO). Recently, Garg et al. (2024) show the existence of -EFX and…