Approximately stable committee selection

DOI10.1145/3357713.3384238OpenAlexW3034326317MaRDI QIDQ5144934

Kamesh Munagala, Zhihao Jiang, Kang-Ning Wang

Publication date: 19 January 2021

Published in: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1910.14008

zbMATH Keywords

fairnesscoreapproximation algorithmscommittee selection

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (4)

Auditing for core stability in participatory budgeting ⋮ Core-stable committees under restricted domains ⋮ Don’t Roll the Dice, Ask Twice: The Two-Query Distortion of Matching Problems and Beyond ⋮ Approval-based apportionment

This page was built for publication: Approximately stable committee selection