Envy-freeness and relaxed stability: hardness and approximation algorithms

DOI10.1007/978-3-030-57980-7_13zbMath1506.91119arXiv1910.07159OpenAlexW3083917466MaRDI QIDQ5918585

Prajakta Nimbhorkar, Meghana Nasre, Prem Krishnaa, Girija Limaye

Publication date: 21 December 2022

Published in: Algorithmic Game Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1910.07159

zbMATH Keywords

approximationenvy-freenesslower quotamatchings under preferencesrelaxed stability

Mathematics Subject Classification ID

Approximation algorithms (68W25) Matching models (91B68) Algorithmic game theory and complexity (91A68)

Related Items (4)

Refined computational complexities of hospitals/residents problem with regional caps ⋮ Envy-freeness and relaxed stability for lower-quotas: a parameterized perspective ⋮ Optimal cost-based allocations under two-sided preferences ⋮ Envy-freeness and relaxed stability: hardness and approximation algorithms

This page was built for publication: Envy-freeness and relaxed stability: hardness and approximation algorithms