activity
20162026
most citedEquitable Allocations of Indivisible Chores

12 citations · 45 across the 20 of their papers we have counts for

collaborators

25 papers

cs.GT2026

To EFX OR to MMS, That is the Question

Hadi Hosseini, Payas Khurana, Shraddha Pathak +1

We study the agent-wise disjunction of two central fairness notions for indivisible items, where every agent must be either envy-free up to any item (EFX) or maximin-share (MMS) sa…

cs.CY2024★ 6 cited

Towards Fair Allocation in Social Commerce Platforms

Anjali Gupta, Shreyans J. Nagori, Abhijnan Chakraborty +5

Social commerce platforms are emerging businesses where producers sell products through re-sellers who advertise the products to other customers in their social network. Due to the…

cs.GT2024

Fair Interval Scheduling of Indivisible Chores

Sarfaraz Equbal, Rohit Gurjar, Yatharth Kumar +3

We study the problem of fairly assigning a set of discrete tasks (or chores) among a set of agents with additive valuations. Each chore is associated with a start and finish time,…

cs.GT2023★ 1 cited

Maximizing Nash Social Welfare under Two-Sided Preferences

Pallavi Jain, Rohit Vaish

The maximum Nash social welfare (NSW) -- which maximizes the geometric mean of agents' utilities -- is a fundamental solution concept with remarkable fairness and efficiency guaran…

cs.GT2023★ 1 cited

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…

cs.DS2023★ 1 cited

Tight Approximations for Graphical House Allocation

Hadi Hosseini, Andrew McGregor, Rik Sengupta +2

The Graphical House Allocation problem asks: how can houses (each with a fixed non-negative value) be assigned to the vertices of an undirected graph , so as to minimize the…