Search Results for author:
Found 2 papers, 0 papers with code
Constrained Serial Rule on the Full Preference Domain
We study the problem of assigning objects to agents in the presence of arbitrary linear constraints when agents are allowed to be indifferent between objects.
Strategy-proof and Envy-free Mechanisms for House Allocation
In this paper, we are motivated by the following question: Is there a strategy-proof and envy-free random assignment mechanism more efficient than equal division?
Cannot find the paper you are looking for? You can
Submit a new open access paper.
