Envy Free

Envy-freeness, a fairness criterion in resource allocation, aims to ensure that no individual prefers another's allocation to their own. Current research focuses on extending envy-freeness to diverse settings, including collective decision-making and resource allocation with indivisible goods or mixed goods (both desirable and undesirable items), often employing algorithms based on optimal transport or score calibration to achieve approximate envy-freeness. These advancements address the computational complexity of achieving perfect envy-freeness and explore trade-offs between fairness, efficiency, and the types of valuations agents may have. The broader impact lies in developing fairer and more equitable algorithms for applications ranging from fair division to recommendation systems and matching problems.