38 citations · 47 across the 12 of their papers we have counts for
12 papers
Best-of-Both-Worlds Fair Allocation of Indivisible and Mixed Goods
Xiaolin Bu, Zihao Li, Shengxin Liu +2
We study the problem of fairly allocating either a set of indivisible goods or a set of mixed divisible and indivisible goods (i.e., mixed goods) to agents with additive utilities,…
Allocating Mixed Goods with Customized Fairness and Indivisibility Ratio
Bo Li, Zihao Li, Shengxin Liu +1
We consider the problem of fairly allocating a combination of divisible and indivisible goods. While fairness criteria like envy-freeness (EF) and proportionality (PROP) can always…
Logarithmic Comparison-Based Query Complexity for Fair Division of Indivisible Goods
Xiaolin Bu, Zihao Li, Shengxin Liu +2
We study the problem of fairly allocating indivisible goods to agents, where agents may have different preferences over the goods. In the traditional setting, agents' valua…
A Complete Landscape for the Price of Envy-Freeness
Zihao Li, Shengxin Liu, Xinhang Lu +2
We study the efficiency of fair allocations using the well-studied price of fairness concept, which quantitatively measures the worst-case efficiency loss when imposing fairness co…
Fair Division with Allocator's Preference
Xiaolin Bu, Zihao Li, Shengxin Liu +2
We study the fair allocation of indivisible resources among agents. Most prior work focuses on fairness and/or efficiency among agents. However, the allocator, as the resource owne…
A Review of Gaps between Web 4.0 and Web 3.0 Intelligent Network Infrastructure
Zihan Zhou, Zihao Li, Xiaoshuai Zhang +2
World Wide Web is speeding up its pace into an intelligent and decentralized ecosystem, as seen in the campaign of Web 3.0 and forthcoming Web 4.0. Marked by the Europe Commission'…
Truthful Fair Mechanisms for Allocating Mixed Divisible and Indivisible Goods
Zihao Li, Shengxin Liu, Xinhang Lu +1
We study the problem of designing truthful and fair mechanisms when allocating a mixture of divisible and indivisible goods. We first show that there does not exist an EFM (envy-fr…
Sample-Based Online Generalized Assignment Problem with Unknown Poisson Arrivals
Zihao Li, Hao Wang, Zhenzhen Yan
We study an edge-weighted online stochastic \emph{Generalized Assignment Problem} with \emph{unknown} Poisson arrivals. In this model, we consider a bipartite graph that contains o…
Fair Division with Prioritized Agents
Xiaolin Bu, Zihao Li, Shengxin Liu +2
We consider the fair division problem of indivisible items. It is well-known that an envy-free allocation may not exist, and a relaxed version of envy-freeness, envy-freeness up to…
Fair and Efficient Multi-Resource Allocation for Cloud Computing
Xiaohui Bei, Zihao Li, Junjie Luo
We study the problem of allocating multiple types of resources to agents with Leontief preferences. The classic Dominant Resource Fairness (DRF) mechanism satisfies several desired…
Approximability Landscape of Welfare Maximization within Fair Allocations
Xiaolin Bu, Zihao Li, Shengxin Liu +2
Fair allocation of indivisible goods studies allocating goods among agents in a fair manner. While fairness is a fundamental requirement in many real-world applications, it…
Fair Division of Mixed Divisible and Indivisible Goods
Xiaohui Bei, Zihao Li, Jinyan Liu +2
We study the problem of fair division when the resources contain both divisible and indivisible goods. Classic fairness notions such as envy-freeness (EF) and envy-freeness up to o…