English

Fairness in the Multi-Secretary Problem

Computer Science and Game Theory 2025-12-01 v1 Artificial Intelligence

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.

Keywords

Cite

@article{arxiv.2511.23097,
  title  = {Fairness in the Multi-Secretary Problem},
  author = {Georgios Papasotiropoulos and Zein Pishbin},
  journal= {arXiv preprint arXiv:2511.23097},
  year   = {2025}
}

Comments

AAAI'26

R2 v1 2026-07-01T07:59:14.599Z