Rank-Envy-Freeness in Roommate Matchings - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2023

Rank-Envy-Freeness in Roommate Matchings

Résumé

In the roommate problem, pairs of agents must be formed, based on ordinal preferences of the agents over each other. In this article, we examine fair roommate matchings by relaxing envy-freeness to account for justified envy based on the rank in the agents’ preferences. A rank-envy-free matching prevents that an agent prefers the partner of another agent whereas she has ranked it better. Although this requirement is pretty weak in house allocation [9], we show that it is more demanding in the roommate setting. We study parameterizations of rank-envy-freeness, as well as further natural relaxations of this concept. We also investigate the connections between the family of rank-based fairness criteria and known optimality or stability concepts.
Fichier principal
Vignette du fichier
rank_envy_Wilczynski2023.pdf (304.82 Ko) Télécharger le fichier
Origine Fichiers éditeurs autorisés sur une archive ouverte
Licence

Dates et versions

hal-04239712 , version 1 (25-10-2023)

Licence

Identifiants

Citer

Baptistin Coutance, Prasanna Maddila, Anaëlle Wilczynski. Rank-Envy-Freeness in Roommate Matchings. 26th European Conference on Artificial Intelligence (ECAI 2023), Sep 2023, Krakow (Cracovie), Poland. ⟨10.3233/FAIA230308⟩. ⟨hal-04239712⟩
41 Consultations
58 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More