activity
20192026
most citedEquitable Allocations of Indivisible Chores

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

collaborators
Showing cs.GTShow all

15 papers · 1 filter

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.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

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.GT20231 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.GT20225 cited

Fairly Dividing Mixtures of Goods and Chores under Lexicographic Preferences

Hadi Hosseini, Sujoy Sikdar, Rohit Vaish +1

We study fair allocation of indivisible goods and chores among agents with \emph{lexicographic} preferences -- a subclass of additive valuations. In sharp contrast to the goods-onl…

cs.GT20221 cited

Two for One One for All: Two-Sided Manipulation in Matching Markets

Hadi Hosseini, Fatima Umar, Rohit Vaish

Strategic behavior in two-sided matching markets has been traditionally studied in a "one-sided" manipulation setting where the agent who misreports is also the intended beneficiar…