22 citations · 73 across the 32 of their papers we have counts for
4 papers · 1 filter
On the Parameterized Complexity of Diverse SAT
Neeldhara Misra, Harshil Mittal, Ashutosh Rai
We study the Boolean Satisfiability problem (SAT) in the framework of diversity, where one asks for multiple solutions that are mutually far apart (i.e., sufficiently dissimilar fr…
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…