Fair Committee Selection with Limited Cardinal Information

This paper addresses the problem of fair committee selection, a relevant issue in various real-world scenarios. It focuses on the challenge of aggregating preferences when only ordinal (ranking) information is available, which is a common limitation. The paper's contribution lies in developing algorithms that achieve good performance (low distortion) with limited access to cardinal (distance) information, overcoming the inherent hardness of the problem. The focus on fairness constraints and the use of distortion as a performance metric make the research practically relevant.