activity
20212026
most citedMulti-Robot Task Allocation -- Complexity and Approximation

14 citations · 29 across the 14 of their papers we have counts for

collaborators
Showing cs.GTShow all

13 papers · 1 filter

cs.GT2026

Strategyproof Mechanisms for Connecting Impassable Regions

Hau Chan, Jianan Lin, Chenhao Wang

We study strategyproof mechanisms for building a pathway between two regions of a line segment separated by an obstacle. Each of the agents has a private location within its re…

cs.GT2026

Improved Randomized Approximations for Strategic Obnoxious Facility Location

Hau Chan, Jianan Lin, Chenhao Wang

We study randomized strategyproof mechanisms for strategic obnoxious facility location on a line segment, where agents wish the facility to be located as far away from them as poss…

cs.GT2026

Randomized Strategyproof Facility Location: Two Facilities and Beyond

Hau Chan, Jianan Lin, Chenhao Wang

We design and analyze randomized strategyproof mechanisms for multi-facility location under the utilitarian social-cost objective, the sum of the agents' distances to their nearest…

cs.GT2026

Improved Metric Distortion Bounds for Deterministic Weighted-Tournament Voting Rules

Hau Chan, Jianan Lin, Chenhao Wang

In metric social choice, voters and candidates lie in a common but unknown metric space, voters rank candidates by distance, and a voting rule seeks to minimize total distance to t…

cs.GT2026

Mechanism Design for Locating a Bridge Between Regions with Prelocated Facilities

Genjie Qin, Chenhao Wang, Jianan Lin +2

In many urban planning projects, social planners require the construction of a bridge to connect two regions separated by obstacles such as rivers or highways. This paper studies t…

cs.GT2026

Strategyproof Mechanisms for Euclidean Facility Location Problems under -norm Social Cost

Hau Chan, Jianan Lin, Chenhao Wang

We study strategyproof mechanisms for eliciting agents' location preferences truthfully in the Euclidean plane and locating a facility so as to minimize the -nor…