3 citations · 3 across the 4 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2025
Minimizing Envy and Maximizing Happiness in Graphical House Allocation
Anubhav Dhar, Ashlesha Hota, Palash Dey +1
We study the house allocation problem in a setting where agents are connected by a graph representing friendships. In this model, two agents can only envy each other if they are ne…
cs.DS2025
Knapsack on Graphs with Relaxed Neighborhood Constraints
Palash Dey, Ashlesha Hota, Sudeshna Kolay
In the knapsack problems with neighborhood constraints that were studied before, the input is a graph on a set of items, each item h…