research
∙
07/24/2023
Tight Approximations for Graphical House Allocation
The Graphical House Allocation (GHA) problem asks: how can n houses (eac...
share
research
∙
05/04/2023
Distribution of Chores with Information Asymmetry
Fair distribution of indivisible tasks with non-positive valuations (aka...
research
∙
05/02/2023
Fairly Allocating Goods and (Terrible) Chores
We study the fair allocation of mixtures of indivisible goods and chores...
research
∙
04/28/2023
Fair Distribution of Delivery Orders
We initiate the study of fair distribution of delivery tasks among a set...
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
∙
03/07/2022
Class Fairness in Online Matching
In the classical version of online bipartite matching, there is a given ...
research
∙
01/29/2022
Fair Stable Matching Meets Correlated Preferences
The stable matching problem sets the economic foundation of several prac...
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
∙
01/19/2022
Ordinal Maximin Share Approximation for Chores
We study the problem of fairly allocating a set of m indivisible chores ...
research
∙
09/04/2021
Ordinal Maximin Share Approximation for Goods
In fair division of indivisible goods, l-out-of-d maximin share (MMS) is...
research
∙
05/19/2021
Guaranteeing Maximin Shares: Some Agents Left Behind
The maximin share (MMS) guarantee is a desirable fairness notion for all...
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/08/2020
Accomplice Manipulation of the Deferred Acceptance Algorithm
The deferred acceptance algorithm is an elegant solution to the stable m...
research
∙
07/17/2020
Learning Desirable Matchings From Partial Preferences
We study the classic problem of matching n agents to n objects, where th...
research
∙
04/28/2020
Fair Division of Time: Multi-layered Cake Cutting
We initiate the study of multi-layered cake cutting with the goal of fai...
research
∙
12/14/2019
The Crawler: Two Equivalence Results for Object (Re)allocation Problems when Preferences Are Single-peaked
For object reallocation problems, if preferences are strict but otherwis...
research
∙
07/04/2019
Fair Division through Information Withholding
Envy-freeness up to one good (EF1) is a well-studied fairness notion for...
research
∙
07/16/2018
An agent-based model of an endangered population of the Arctic fox from Mednyi Island
Artificial Intelligence techniques such as agent-based modeling and prob...
research
∙
03/01/2017
Investigating the Characteristics of One-Sided Matching Mechanisms Under Various Preferences and Risk Attitudes
One-sided matching mechanisms are fundamental for assigning a set of ind...
research
∙
03/04/2015
Random Serial Dictatorship versus Probabilistic Serial Rule: A Tale of Two Random Mechanisms
For assignment problems where agents, specifying ordinal preferences, ar...
research
∙
07/07/2014