Fairness in the Multi-Secretary Problem

Authors

  • Georgios Papasotiropoulos University of Warsaw
  • Zein Pishbin University of Warsaw Université Paris Dauphine - PSL

DOI:

https://doi.org/10.1609/aaai.v40i20.38769

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.

Published

2026-03-14

How to Cite

Papasotiropoulos, G., & Pishbin, Z. (2026). Fairness in the Multi-Secretary Problem. Proceedings of the AAAI Conference on Artificial Intelligence, 40(20), 17188–17196. https://doi.org/10.1609/aaai.v40i20.38769

Issue

Section

AAAI Technical Track on Game Theory and Economic Paradigms