3 papers
cs.GT2026
Metric Facility Assignment with Partial Information
Vasilis Gkatzelis, Hasti Karimi, Emma Rewinski +2
We study an assignment problem where a set of agents and a set of facilities lie on a line metric. The goal is to compute an assignment of agents to facilities to approximately min…
cs.CC2026
Lower Bounds for Approximate Sign Rank
Riju Bindua, Hamed Hatami, Hasti Karimi +1
We prove new upper and lower bounds on -approximate sign-rank, a relaxation of sign-rank introduced by Chornomaz, Moran, and Waknine (STOC 2025). We show that every $m \times n…
cs.GT2026
Distortion of Multi-Winner Elections on the Line Metric: The Polar Comparison Rule
Negar Babashah, Hasti Karimi, Masoud Seddighin +1
We study the problem of minimizing metric distortion in multi-winner elections, where a committee of size is selected from a set of candidates based on voters' ordinal preferen…