2 citations · 3 across the 4 of their papers we have counts for
4 papers
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…
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…
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…
Efficient Algorithms for Maximal k-Biplex Enumeration
Kaiqiang Yu, Cheng Long, Shengxin Liu +1
Mining maximal subgraphs with cohesive structures from a bipartite graph has been widely studied. One important cohesive structure on bipartite graphs is k-biplex, where each verte…