12 citations · 44 across the 13 of their papers we have counts for
11 papers · 1 filter
Multiagent MST Cover: Pleasing All Optimally via A Simple Voting Rule
Bo Li, Xiaowei Wu, Chenyang Xu +1
Given a connected graph on whose edges we can build roads to connect the nodes, a number of agents hold possibly different perspectives on which edges should be selected by assigni…
Mixed Strategies for Security Games with General Defending Requirements
Rufan Bai, Haoxing Lin, Xinyu Yang +3
The Stackelberg security game is played between a defender and an attacker, where the defender needs to allocate a limited amount of resources to multiple targets in order to minim…
Algorithmic Fair Allocation of Indivisible Items: A Survey and New Questions
Haris Aziz, Bo Li, Herve Moulin +1
The theory of algorithmic fair allocation is within the center of multi-agent systems and economics in the last decade due to its industrial and social importance. At a high level,…
Approximately Envy-Free Budget-Feasible Allocation
Jiarui Gan, Bo Li, Xiaowei Wu
In the budget-feasible allocation problem, a set of items with varied sizes and values are to be allocated to a group of agents. Each agent has a budget constraint on the total siz…
Almost (Weighted) Proportional Allocations for Indivisible Chores
Bo Li, Yingkai Li, Xiaowei Wu
In this paper, we study how to fairly allocate m indivisible chores to n (asymmetric) agents. We consider (weighted) proportionality up to any item (PROPX) and show that a (weighte…
Approximate and Strategyproof Maximin Share Allocation of Chores with Ordinal Preferences
Haris Aziz, Bo Li, Xiaowei Wu
We initiate the work on maximin share (MMS) fair allocation of m indivisible chores to n agents using only their ordinal preferences, from both algorithmic and mechanism design per…