Search Results for author:
Found 3 papers, 0 papers with code
Improving Welfare in One-sided Matching using Simple Threshold Queries
Most work on such problems assume that the agents only have ordinal preferences and usually the goal in them is to compute a matching that satisfies some notion of economic efficiency.
Algorithmic Stability in Fair Allocation of Indivisible Goods Among Two Agents
To address this, we introduce a notion of algorithmic stability and study it in the context of fair and efficient allocations of indivisible goods among two agents.
Necessarily Optimal One-Sided Matchings
We study the classical problem of matching $n$ agents to $n$ objects, where the agents have ranked preferences over the objects.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
