activity
20202022
most citedFairly Dividing Mixtures of Goods and Chores under Lexicographic Preferences

5 citations · 15 across the 6 of their papers we have counts for

collaborators

11 papers

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

Class Fairness in Online Matching

Hadi Hosseini, Zhiyi Huang, Ayumi Igarashi +1

In the classical version of online bipartite matching, there is a given set of offline vertices (aka agents) and another set of vertices (aka items) that arrive online. When each i…

cs.GT20221 cited

Fair Stable Matching Meets Correlated Preferences

Angelina Brilliantova, Hadi Hosseini

The stable matching problem sets the economic foundation of several practical applications ranging from school choice and medical residency to ridesharing and refugee placement. It…

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…

cs.GT20224 cited

Ordinal Maximin Share Approximation for Chores

Hadi Hosseini, Andrew Searns, Erel Segal-Halevi

We study the problem of fairly allocating a set of m indivisible chores (items with non-positive value) to n agents. We consider the desirable fairness notion of 1-out-of-d maximin…

cs.GT2021

Surprisingly Popular Voting Recovers Rankings, Surprisingly!

Hadi Hosseini, Debmalya Mandal, Nisarg Shah +1

The wisdom of the crowd has long become the de facto approach for eliciting information from individuals or experts in order to predict the ground truth. However, classical democra…