Fairness in the Multi-Secretary Problem
Georgios Papasotiropoulos, Zein Pishbin
TL;DR
This work addresses fairness in online multi-winner selection with cardinal ballots by formalizing the online multi-secretary/election model and proving that Extended Justified Representation (EJR) cannot be satisfied online. It then develops and analyzes online adaptations of voting rules, notably Online Method of Equal Shares (with BOS), Greedy Budgeting, and Online Nash, providing probabilistic guarantees and empirical validation. The theoretical results emphasize impossibility of strong proportionality and justify risk-tolerant online strategies, while experiments show BOS often yields the strongest fairness signals and robust performance across diverse datasets. The findings offer practical mechanisms for fair online decision-making in settings such as hiring, participatory budgeting, and online funding platforms.
Abstract
This paper bridges two perspectives: it studies the multi-secretary problem through the fairness lens of social choice, and examines multi-winner elections from the viewpoint of online decision making. After identifying the limitations of the prominent proportionality notion of Extended Justified Representation (EJR) in the online domain, the work proposes a set of mechanisms that merge techniques from online algorithms with rules from social choice -- such as the Method of Equal Shares and the Nash Rule -- and supports them through both theoretical analysis and extensive experimental evaluation.
