6 papers
An axiomatic model of robust Bayesian persuasion
Wataru Kitano, Shohei Yanagita
We develop an axiomatic model of robust Bayesian persuasion where the sender cannot fully control the information available to the receiver. After selecting an information structur…
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…
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…