← Search

Hadi Yami

2 accepted papers

2024

Almost Envy-Free Allocations of Indivisible Goods or Chores with Entitlements

AAAI 2024technical

We here address the problem of fairly allocating indivisible goods or chores to n agents with weights that define their entitlement to the set of indivisible resources. Stemming from well-studied fairness concepts such as envy-freeness up to one good (EF1) and envy-freeness up to any good (EFX) for…

Cited by 9SourcePDFScholar
2021

Almost Envy-freeness, Envy-rank, and Nash Social Welfare Matchings

AAAI 2021technical

Envy-freeness up to one good (EF1) and envy-freeness up to any good (EFX) are two well-known extensions of envy-freeness for the case of indivisible items. It is shown that EF1 can always be guaranteed for agents with subadditive valuations. In sharp contrast, it is unknown whether or not an EFX all…

Cited by 26SourcePDFScholar