10 citations · 29 across the 16 of their papers we have counts for
5 papers · 1 filter
Tight Approximations for Graphical House Allocation
Hadi Hosseini, Andrew McGregor, Rik Sengupta +2
The Graphical House Allocation problem asks: how can houses (each with a fixed non-negative value) be assigned to the vertices of an undirected graph , so as to minimize the…
Fairly Allocating Goods and (Terrible) Chores
Hadi Hosseini, Aghaheybat Mammadov, Tomasz Wąs
We study the fair allocation of mixtures of indivisible goods and chores under lexicographic preferences$\unicode{x2014}$a subdomain of additive preferences. A prominent fairness n…
Distribution of Chores with Information Asymmetry
Hadi Hosseini, Joshua Kavner, Tomasz Wąs +1
A well-regarded fairness notion when dividing indivisible chores is envy-freeness up to one item (EF1), which requires that pairwise envy can be eliminated by the removal of a sing…
Fair Distribution of Delivery Orders
Hadi Hosseini, Shivika Narang, Tomasz Wąs
We initiate the study of fair distribution of delivery tasks among a set of agents wherein delivery jobs are placed along the vertices of a graph. Our goal is to fairly distribute…
Graphical House Allocation
Hadi Hosseini, Justin Payan, Rik Sengupta +2
The classical house allocation problem involves assigning houses (or items) to agents according to their preferences. A key criterion in such problems is satisfying some fa…