6 citations · 11 across the 8 of their papers we have counts for
9 papers
Equilibrium Pricing in Oligopolistic Data Markets
Bhaskar Ray Chaudhury, Jugal Garg, Eklavya Sharma +1
We study equilibrium pricing in oligopolistic data markets with budget-constrained buyers (e.g., machine learning companies purchasing data to improve model accuracy) and strategic…
Approximate Butterfly Counting in Sublinear Time
Chi Luo, Jiaxin Song, Yuhao Zhang +3
Bipartite graphs serve as a natural model for representing relationships between two different types of entities. When analyzing bipartite graphs, butterfly counting is a fundament…
Online MMS Allocation for Chores
Jiaxin Song, Biaoshuai Tao, Wenqian Wang +1
We study the problem of fair division of indivisible chores among agents in an online setting, where items arrive sequentially and must be allocated irrevocably upon arrival. T…
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…
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…
EFX Allocations Exist for Binary Valuations
Xiaolin Bu, Jiaxin Song, Ziqi Yu
We study the fair division problem and the existence of allocations satisfying the fairness criterion envy-freeness up to any item (EFX). The existence of EFX allocations is a majo…
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…
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…
On Existence of Truthful Fair Cake Cutting Mechanisms
Xiaolin Bu, Jiaxin Song, Biaoshuai Tao
We study the fair division problem on divisible heterogeneous resources (the cake cutting problem) with strategic agents, where each agent can manipulate his/her private valuation…