activity
20192026
most citedFair Division of Mixed Divisible and Indivisible Goods

38 citations · 66 across the 15 of their papers we have counts for

collaborators

17 papers

cs.GT2026

Non-Existence of PMMS Allocations and a -PMMS Guarantee for Additive Chores

Xiaohui Bei, Zehan Lin, Shengxin Liu +2

We study pairwise maximin share (PMMS) fairness for indivisible items with additive preferences. We give a polynomial-time reduction from chores to goods that preserves the existen…

cs.GT2026

Comparison-Based Fair Division of Indivisible Chores

Zehan Lin, Shengxin Liu, Biaoshuai Tao +1

We investigate the query complexity of fairly allocating indivisible chores among agents with additive cost functions. We depart from the standard cardinal model and assume…

cs.GT2026

Almost Envy-Freeness for Additive Mixed Manna with Entitlements: Deterministic and Randomized Guarantees

Zehan Lin, Shengxin Liu, Biaoshuai Tao +1

We investigate the fair allocation of indivisible items among agents with asymmetric entitlements in mixed manna settings, where the items consist of both goods and chores. For add…

cs.GT2026

Sample Complexity of the Second-Best Bilateral Trade

Qiaoyun Shi, Shengxin Liu, Zongqi Wan

We study the sample complexity of learning near-optimal bilateral trade mechanisms. Unlike previous work on learning simple or fixed-price bilateral-trade mechanisms, we focus on m…

cs.GT2026

Non-Existence of EFX Chore Allocations for Monotone Cost Functions with Binary Marginals

Zehan Lin, Shengxin Liu, Biaoshuai Tao +1

We study the existence of envy-free up to any item (EFX) allocations of indivisible chores when agents have monotone cost functions with binary marginals. For indivisible goods, th…

cs.GT2024

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,…

cs.GT2024

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…

cs.GT2024

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…

cs.GT2024★ 2 cited

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…

cs.GT2023

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…

cs.GT2023

Fair Division with Subjective Divisibility

Xiaohui Bei, Shengxin Liu, Xinhang Lu

The classic fair division problems assume the resources to be allocated are either divisible or indivisible, or contain a mixture of both, but the agents always have a predetermine…

cs.GT2023★ 10 cited

Mixed Fair Division: A Survey

Shengxin Liu, Xinhang Lu, Mashbat Suzuki +1

Fair division considers the allocation of scarce resources among agents in such a way that every agent gets a fair share. It is a fundamental problem in society and has received si…

cs.GT2023★ 1 cited

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…

cs.GT2022

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…

cs.GT2022★ 5 cited

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…

cs.GT2020★ 10 cited

Maximin Fairness with Mixed Divisible and Indivisible Goods

Xiaohui Bei, Shengxin Liu, Xinhang Lu +1

We study fair resource allocation when the resources contain a mixture of divisible and indivisible goods, focusing on the well-studied fairness notion of maximin share fairness (M…

cs.GT2019★ 38 cited

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…