6 citations · 13 across the 8 of their papers we have counts for
Showing cs.GTShow all
2 papers · 1 filter
cs.GT2023
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…
cs.GT2022★ 1 cited
Relaxations of Envy-Freeness Over Graphs
Justin Payan, Rik Sengupta, Vignesh Viswanathan
When allocating a set of indivisible items among agents, the ideal condition of envy-freeness cannot always be achieved. Envy-freeness up to any good (EFX), and envy-freeness with…