22 citations · 73 across the 32 of their papers we have counts for
11 papers · 1 filter
Envy-Free and Efficient Allocations for Graphical Valuations
Neeldhara Misra, Aditi Sethia
We consider the complexity of finding envy-free allocations for the class of graphical valuations. Graphical valuations were introduced by Christodoulou et. al.(2023) as a structur…
A Little Aggression Goes a Long Way
Jyothi Krishnan, Neeldhara Misra, Saraswati Girish Nanoti
Aggression is a two-player game of troop placement and attack played on a map (modeled as a graph). Players take turns deploying troops on a territory (a vertex on the graph) until…
The Cost and Complexity of Minimizing Envy in House Allocation
Jayakrishnan Madathil, Neeldhara Misra, Aditi Sethia
We study almost-envy-freeness in house allocation, where houses are to be allocated among agents so that every agent receives exactly one house. An envy-free allocation nee…
The Price of Equity with Binary Valuations and Few Agent Types
Umang Bhaskar, Neeldhara Misra, Aditi Sethia +1
In fair division problems, the notion of price of fairness measures the loss in welfare due to a fairness constraint. Prior work on the price of fairness has focused primarily on e…
On Fair Division with Binary Valuations Respecting Social Networks
Neeldhara Misra, Debanuj Nayak
We study the computational complexity of finding fair allocations of indivisible goods in the setting where a social network on the agents is given. Notions of fairness in this con…
Equitable Division of a Path
Neeldhara Misra, Chinmay Sonar, P. R. Vaidyanathan +1
We study fair resource allocation under a connectedness constraint wherein a set of indivisible items are arranged on a path and only connected subsets of items may be allocated to…