30 citations · 32 across the 5 of their papers we have counts for
Showing 2019Show all
3 papers · 1 filter
cs.GT2019★ 1 cited
Approximately Stable Committee Selection
Zhihao Jiang, Kamesh Munagala, Kangning Wang
In the committee selection problem, we are given candidates, and voters. Candidates can have different weights. A committee is a subset of candidates, and its weight is the…
cs.GT2019★ 30 cited
Group Fairness in Committee Selection
Yu Cheng, Zhihao Jiang, Kamesh Munagala +1
In this paper, we study fairness in committee selection problems. We consider a general notion of fairness via stability: A committee is stable if no coalition of voters can deviat…
cs.DS2019
An FPTAS for Stochastic Unbounded Min-Knapsack Problem
Zhihao Jiang, Haoyu Zhao
In this paper, we study the stochastic unbounded min-knapsack problem (). The ordinary unbounded min-knapsack problem states that: There are types of items,…