19 citations · 19 across the 3 of their papers we have counts for
5 papers
Almost Envy-Free Allocations of Indivisible Goods or Chores with Entitlements
MohammadTaghi Hajiaghayi, Max Springer, Hadi Yami
We here address the problem of fairly allocating indivisible goods or chores to agents with weights that define their entitlement to the set of indivisible resources. Stemming…
Almost Envy-freeness, Envy-rank, and Nash Social Welfare Matchings
Alireza Farhadi, MohammadTaghi Hajiaghayi, Mohamad Latifian +2
Envy-free up to one good (EF1) and envy-free 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…
Fair Allocation of Indivisible Goods to Asymmetric Agents
Alireza Farhadi, Mohammad Ghodsi, MohammadTaghi Hajiaghayi +5
We study fair allocation of indivisible goods to agents with unequal entitlements. Fair allocation has been the subject of many studies in both divisible and indivisible settings.…
Fair Allocation of Indivisible Goods: Improvement and Generalization
Mohammad Ghodsi, MohammadTaghi Hajiaghayi, Masoud Seddighin +2
We study the problem of fair allocation for indivisible goods. We use the the maxmin share paradigm introduced by Budish as a measure for fairness. Procaccia and Wang (EC'14) were…
A New Upper Bound on Total Domination Number of Bipartite Graphs
Saieed Akbari, Pooyan Ehsani, Sahar Qajar +2
Let be a graph. A subset is called a total dominating set if every vertex of is adjacent to at least one vertex of . The total domination number, $…