activity
20242026
most citedAlmost Envy-Freeness under Weakly Lexicographic Preferences

1 citations · 1 across the 8 of their papers we have counts for

collaborators
Showing cs.GTShow all

7 papers · 1 filter

cs.GT2025

The Landscape of Almost Equitable Allocations

Hadi Hosseini, Vishwa Prakash HV, Aditi Sethia +1

Equitability is a fundamental notion in fair division which requires that all agents derive equal value from their allocated bundles. We study, for general (possibly non-monotone)…

cs.GT2025

Fair Societies: Algorithms for House Allocations

Hadi Hosseini, Sanjukta Roy, Aditi Sethia

House Allocations concern with matchings involving one-sided preferences, where houses serve as a proxy encoding valuable indivisible resources (e.g. organs, course seats, subsidiz…

cs.GT2025

Equitable Allocations of Mixtures of Goods and Chores

Hadi Hosseini, Aditi Sethia

Equitable allocation of indivisible items involves partitioning the items among agents such that everyone derives (almost) equal utility. We consider the approximate notion of \tex…

cs.GT2024

Strategyproof Matching of Roommates and Rooms

Hadi Hosseini, Shivika Narang, Sanjukta Roy

We initiate the study of matching roommates and rooms wherein the preferences of agents over other agents and rooms are complementary and represented by Leontief utilities. In this…

cs.GT2024

Putting Gale & Shapley to Work: Guaranteeing Stability Through Learning

Hadi Hosseini, Sanjukta Roy, Duohan Zhang

Two-sided matching markets describe a large class of problems wherein participants from one side of the market must be matched to those from the other side according to their prefe…

cs.GT2024

The Degree of Fairness in Efficient House Allocation

Hadi Hosseini, Medha Kumar, Sanjukta Roy

The classic house allocation problem is primarily concerned with finding a matching between a set of agents and a set of houses that guarantees some notion of economic efficiency (…