7 citations · 25 across the 23 of their papers we have counts for
28 papers
Nonexistence of Simultaneously EF1 and Pareto Optimal Allocations for Submodular Valuations
Harish Chandramouleeswaran, Prajakta Nimbhorkar
The existence of allocations of indivisible goods that are simultaneously fair (envy-free up to one item (EF1)) and efficient (Pareto optimal (PO)) when agents have monotone submod…
Almost and Approximate EFX for Few Types of Agents
Vishwa Prakash HV, Ruta Mehta, Prajakta Nimbhorkar
We study the problem of fair allocation of a set of indivisible goods among agents with distinct additive valuations, with the goal of achieving approximate envy-freeness u…
Group Fair Matchings using Convex Cost Functions
Atasi Panda, Harsh Sharma, Anand Louis +1
We consider the problem of assigning items to platforms where each item has a utility associated with each of the platforms to which it can be assigned. Each platform has a soft co…
Optimal Capacity Modification for Stable Matchings with Ties
Keshav Ranjan, Meghana Nasre, Prajakta Nimbhorkar
We consider the Hospitals/Residents (HR) problem in the presence of ties in hospital preferences. Among the three notions of stability, namely weak stability, strong stability, and…
Fair Division in a Variable Setting
Harish Chandramouleeswaran, Prajakta Nimbhorkar, Nidhi Rathi
We study fair division of indivisible items under a variable input setting, where the set of agents or items may change over time. Starting from an arbitrary allocation, the goal i…
EFX Exists for Three Types of Agents
Vishwa Prakash HV, Pratik Ghosal, Prajakta Nimbhorkar +1
We study the problem of finding an envy-free allocation of indivisible goods among agents with additive valuations. We focus on the fairness notion of envy-freeness up to any good…