research
∙
07/24/2023
Tight Approximations for Graphical House Allocation
The Graphical House Allocation (GHA) problem asks: how can n houses (eac...
share
research
∙
07/13/2023
The Price of Equity with Binary Valuations and Few Agent Types
In fair division problems, the notion of price of fairness measures the ...
research
∙
01/03/2023
Graphical House Allocation
The classical house allocation problem involves assigning n houses (or i...
research
∙
12/08/2022
Hide, Not Seek: Perceived Fairness in Envy-Free Allocations of Indivisible Goods
Fair division provides a rich computational and mathematical framework f...
research
∙
03/14/2022
Fairly Dividing Mixtures of Goods and Chores under Lexicographic Preferences
We study fair allocation of indivisible goods and chores among agents wi...
research
∙
01/21/2022
Two for One & One for All: Two-Sided Manipulation in Matching Markets
Strategic behavior in two-sided matching markets has been traditionally ...
research
∙
05/28/2021
Matchings and Copeland's Method
Given a graph G = (V,E) where every vertex has weak preferences over its...
research
∙
01/24/2021
Equitable Division of a Path
We study fair resource allocation under a connectedness constraint where...
research
∙
12/14/2020
Fair and Efficient Allocations under Lexicographic Preferences
Envy-freeness up to any good (EFX) provides a strong and intuitive guara...
research
∙
12/12/2020
On Approximate Envy-Freeness for Indivisible Chores and Mixed Resources
We study the fair allocation of undesirable indivisible items, or chores...
research
∙
12/12/2020
Representative Proxy Voting
We study a model of proxy voting where the candidates, voters, and proxi...
research
∙
12/08/2020
Accomplice Manipulation of the Deferred Acceptance Algorithm
The deferred acceptance algorithm is an elegant solution to the stable m...
research
∙
05/28/2020
Best of Both Worlds: Ex-Ante and Ex-Post Fairness in Resource Allocation
We study the problem of allocating indivisible goods among agents with a...
research
∙
02/24/2020
Equitable Allocations of Indivisible Chores
We study fair allocation of indivisible chores (i.e., items with non-pos...
research
∙
07/04/2019
Fair Division through Information Withholding
Envy-freeness up to one good (EF1) is a well-studied fairness notion for...
research
∙
05/27/2019
Minimizing Time-to-Rank: A Learning and Recommendation Approach
Consider the following problem faced by an online voting platform: A use...
research
∙
05/25/2019
Equitable Allocations of Indivisible Goods
In fair division, equitability dictates that each participant receives t...
research
∙
02/18/2019
Stable fractional matchings
We study a generalization of the classical stable matching problem that ...
research
∙
01/27/2018