activity
20162026
most citedNetworked Fairness in Cake Cutting

6 citations · 8 across the 7 of their papers we have counts for

collaborators
Showing cs.GTShow all

14 papers · 1 filter

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

Individual Fairness in Budget Aggregation

Xiaohui Bei, Felix Brandt, Matthias Greger +3

We consider the problem of aggregating individual distributions over alternatives into a collective distribution, also known as budget aggregation. Existing fairness notion…

cs.GT2026

Fair Division by Contribution: A Shapley Value Perspective

Xiaohui Bei, Pinyan Lu, Xiaowei Wu +1

In many resource allocation problems, agents' valuations are best interpreted not as subjective preferences, but as the value they generate from receiving resources. Such valuation…

cs.GT2026

EconCSLib: A Lean Library for Computational Economics and AI-Assisted Research

Xiaohui Bei, Jiajun Ma, Zhan Jing +2

Mathematical formalization uses interactive theorem provers to turn informal mathematical statements into machine-checkable artifacts. The success of mathlib, a large collaborative…

cs.GT2026

Approximate Maximin Share with Subjective Divisibility: Beating the 1/2 Barrier

Xiaohui Bei, Ke Ding, Bo Li +1

Maximin share (MMS) stands out as a central notion in fair resource allocation. It is known that exact MMS fairness is not always attainable, especially when agents differ along tw…

cs.GT2024

Welfare Loss in Connected Resource Allocation

Xiaohui Bei, Alexander Lam, Xinhang Lu +1

We study the allocation of indivisible items that form an undirected graph and investigate the worst-case welfare loss when requiring that each agent must receive a connected subgr…