2021
Improving Welfare in One-Sided Matchings using Simple Threshold Queries
IJCAI 2021poster
We study one-sided matching problems where each agent must be assigned at most one object. In this classic problem it is often assumed that agents specify only ordinal preferences over objects and the goal is to return a matching that satisfies some desirable property such as Pareto optimality or ra…