activity
20142026
most citedMechanism Design for Facility Location Problems: A Survey

11 citations · 36 across the 35 of their papers we have counts for

collaborators
Showing 2021Show all

7 papers · 1 filter

cs.NI2021

Composite Resource Scheduling for Networked Control Systems

Peng Wu, Chenchen Fu, Tianyu Wang +4

Real-time end-to-end task scheduling in networked control systems (NCSs) requires the joint consideration of both network and computing resources to guarantee the desired quality o…

cs.DS2021★ 1 cited

Online Ride-Hitching in UAV Travelling

Songhua Li, Minming Li, Lingjie Duan +1

The unmanned aerial vehicle (UAV) has emerged as a promising solution to provide delivery and other mobile services to customers rapidly, yet it drains its stored energy quickly wh…

cs.GT2021

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…

cs.GT2021

Fair Allocation with Interval Scheduling Constraints

Bo Li, Minming Li, Ruilong Zhang

We study a fair resource scheduling problem, where a set of interval jobs are to be allocated to heterogeneous machines controlled by agents. Each job is associated with release ti…

cs.GT2021★ 4 cited

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…

cs.GT2021★ 11 cited

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…

cs.DS2021

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…