Metraipolis › archive › dc_20e02a10f3df

Matchings under One-Sided Preferences with Soft Quotas — arXiv:2611.05037

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.05037
License (as archived)
CC0-1.0
Archived
2026-11-04T12:59:24.331Z
SHA-256 of the archived text
3a4a4cae9b716311cc45c558e04152a687b37a72be1b66fa72e69c4dae321c15
Stable URL of this page
https://metraipolis.com/documento/dc_20e02a10f3df

How to cite

Matchings under One-Sided Preferences with Soft Quotas — arXiv:2611.05037 — arXiv (en), https://arxiv.org/abs/2611.05037 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_20e02a10f3df (Metraipolis archive dc_20e02a10f3df, sha256 3a4a4cae9b716311cc45c558e04152a687b37a72be1b66fa72e69c4dae321c15)
BibTeX
@misc{dc20e02a10f3df,
  title = {Matchings under One-Sided Preferences with Soft Quotas — arXiv:2611.05037},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.05037},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_20e02a10f3df; sha256 3a4a4cae9b716311cc45c558e04152a687b37a72be1b66fa72e69c4dae321c15},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.05037. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Assigning applicants to posts in the presence of applicant preferences and quotas associated with posts is extensively investigated. For a post, a lower quota guarantees, and an upper quota limits the number of applicants assigned to it. Typically, quotas are assumed to be fixed, which need not be the case in practice. We address this by introducing a soft quota setting, in which every post is associated with two values - lower target and upper target - which together denote a range for the intended number of applicants in any assignment. Unlike the fixed quota setting, we allow the number of applicants assigned to a post to fall outside the range. This leads to assignments with deviation. Here, we study the problem of computing an assignment that has two orthogonal optimization objectives - minimizing the deviation (maximum or total) with respect to soft quotas and ensuring optimality with respect to preferences of applicants (rank-maximality or fairness). The order in which these objectives are considered, the different possibilities to optimize deviation combined with the well-studied notions of optimality with respect to preferences open up a range of optimization problems of practical importance. We present efficient algorithms based on flow networks to solve these optimization problems. We also consider a generalization of the soft quota setting, where every deviation is associated with a cost. We show extensions of our algorithms for solving the problems in this setting.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv cs.DS, nuovi lavori del giorno).
Categorie arXiv: Data Structures and Algorithms (cs.DS).
Pagina del lavoro: https://arxiv.org/abs/2611.05037 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-04T12:35:02.328Z dalla pagina https://arxiv.org/list/cs.DS/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).