16 citations · 16 across the 1 of their papers we have counts for
6 papers
Fair and Efficient Resource Allocation with Partial Information
Daniel Halpern, Nisarg Shah
We study the fundamental problem of allocating indivisible goods to agents with additive preferences. We consider eliciting from each agent only a ranking of her most preferred…
Distortion in Social Choice Problems: The First 15 Years and Beyond
Elliot Anshelevich, Aris Filos-Ratsikas, Nisarg Shah +1
The notion of distortion in social choice problems has been defined to measure the loss in efficiency -- typically measured by the utilitarian social welfare, the sum of utilities…
Necessarily Optimal One-Sided Matchings
Hadi Hosseini, Vijay Menon, Nisarg Shah +1
We study the classical problem of matching agents to objects, where the agents have ranked preferences over the objects. We focus on two popular desiderata from the matchin…
Fair Algorithms for Multi-Agent Multi-Armed Bandits
Safwan Hossain, Evi Micha, Nisarg Shah
We propose a multi-agent variant of the classical multi-armed bandit problem, in which there are agents and arms, and pulling an arm generates a (possibly different) stocha…
Optimal Bounds on the Price of Fairness for Indivisible Goods
Siddharth Barman, Umang Bhaskar, Nisarg Shah
In the allocation of resources to a set of agents, how do fairness guarantees impact the social welfare? A quantitative measure of this impact is the price of fairness, which measu…
Fair Division with Binary Valuations: One Rule to Rule Them All
Daniel Halpern, Ariel D. Procaccia, Alexandros Psomas +1
We study fair allocation of indivisible goods among agents. Prior research focuses on additive agent preferences, which leads to an impossibility when seeking truthfulness, fairnes…