93 citations · 155 across the 32 of their papers we have counts for
6 papers · 1 filter
Defending with Shared Resources on a Network
Minming Li, Long Tran-Thanh, Xiaowei Wu
In this paper we consider a defending problem on a network. In the model, the defender holds a total defending resource of R, which can be distributed to the nodes of the network.…
Upper and Lower Bounds for Fully Retroactive Graph Problems
Monika Henzinger, Xiaowei Wu
Classic dynamic data structure problems maintain a data structure subject to a sequence S of updates and they answer queries using the latest version of the data structure, i.e., t…
Well-behaved Online Load Balancing Against Strategic Jobs
Bo Li, Minming Li, Xiaowei Wu
In the online load balancing problem on related machines, we have a set of jobs (with different sizes) arriving online, and we need to assign each job to a machine immediately upon…
Towards a Better Understanding of Randomized Greedy Matching
Zhihao Gavin Tang, Xiaowei Wu, Yuhao Zhang
There has been a long history for studying randomized greedy matching algorithms since the work by Dyer and Frieze~(RSA 1991). We follow this trend and consider the problem formula…
Strategyproof and Approximately Maxmin Fair Share Allocation of Chores
Haris Aziz, Bo Li, Xiaowei Wu
We initiate the work on fair and strategyproof allocation of indivisible chores. The fairness concept we consider in this paper is maxmin share (MMS) fairness. We consider three pr…
Maximin-Aware Allocations of Indivisible Goods
Hau Chan, Jing Chen, Bo Li +1
We study envy-free allocations of indivisible goods to agents in settings where each agent is unaware of the goods allocated to other agents. In particular, we propose the maximin…