Fairness in the Multi-Secretary Problem
By: Georgios Papasotiropoulos, Zein Pishbin
Potential Business Impact:
Helps choose fair winners when people vote online.
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.
Similar Papers
On Minimal Achievable Quotas in Multiwinner Voting
CS and Game Theory
Makes voting fairer by changing rules for each election.
Utilitarian Guarantees for the Method of Equal Shares
CS and Game Theory
Guarantees fair project funding while maximizing benefits.
Understanding the Impact of Proportionality in Approval-Based Multiwinner Elections
CS and Game Theory
Helps pick fairer voting groups for elections.