24 citations · 72 across the 16 of their papers we have counts for
7 papers · 1 filter
Sequential Blocked Matching
Nicholas Bishop, Hau Chan, Debmalya Mandal +1
We consider a sequential blocked matching (SBM) model where strategic agents repeatedly report ordinal preferences over a set of services to a central planner. The planner's goal i…
Facility Location Games with Ordinal Preferences
Hau Chan, Minming Li, Chenhao Wang
We consider a new setting of facility location games with ordinal preferences. In such a setting, we have a set of agents and a set of facilities. Each agent is located on a line a…
Strategyproof Mechanisms For Group-Fair Facility Location Problems
Houyu Zhou, Minming Li, Hau Chan
We study the facility location problems where agents are located on a real line and divided into groups based on criteria such as ethnicity or age. Our aim is to design mechanisms…
Mechanism Design for Facility Location Problems: A Survey
Hau Chan, Aris Filos-Ratsikas, Bo Li +2
The study of approximate mechanism design for facility location problems has been in the center of research at the intersection of artificial intelligence and economics for the las…
On maximizing a monotone -submodular function under a knapsack constraint
Zhongzheng Tang, Chenhao Wang, Hau Chan
We study the problem of maximizing a non-negative monotone -submodular function under a knapsack constraint, where a -submodular function is a natural generalization of a…
Multi-Robot Task Allocation -- Complexity and Approximation
Haris Aziz, Hau Chan, Ágnes Cseh +3
Multi-robot task allocation is one of the most fundamental classes of problems in robotics and is crucial for various real-world robotic applications such as search, rescue and are…
Maximizing approximately k-submodular functions
Leqian Zheng, Hau Chan, Grigorios Loukides +1
We introduce the problem of maximizing approximately -submodular functions subject to size constraints. In this problem, one seeks to select -disjoint subsets of a ground set…