TTC Domains
We study the object reallocation problem under strict preferences. On the unrestricted domain, Ekici (2024) showed that the Top Trading Cycles (TTC) mechanism is the unique mechanism that is individually rational, pair efficient, and strategyproof. We provide an alternative proof of this result, assuming only minimal richness of the unrestricted domain. This allows us to identify a broad class of restricted domains, those satisfying our top-two condition, on which the characterization continues to hold. The condition requires that, within any subset of objects, if two objects can each be most-preferred, they can also be the top two most-preferred objects (in both possible orders). We show that this condition is also necessary in the special case of three objects. These results unify and strengthen prior findings on specific domains such as single-peaked and single-dipped domain, and more broadly, offer a useful criterion for analyzing restricted preference domains.
Code (0)
등록된 구현이 없습니다.
Methods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
A Taxonomy of Non-dictatorial Unidimensional Domains
A preference domain is called a non-dictatorial domain if it allows the design of unanimous social choice functions (henceforth, rules) that are non-dictatorial and strategy-proof. We study a class of preference domains …
ClassificationOut-of-Distribution Generalization Analysis via Influence Function
The mismatch between training and target data is one major challenge for current machine learning systems. When training data is collected from multiple domains and the target domains include all training domains and oth…
Out-of-Distribution GeneralizationIDM: An Intermediate Domain Module for Domain Adaptive Person Re-ID
Unsupervised domain adaptive person re-identification (UDA re-ID) aims at transferring the labeled source domain's knowledge to improve the model's discriminability on the unlabeled target domain. From a novel perspectiv…
DiversityDomain Adaptive Person Re-IdentificationPerson Re-IdentificationBridging the Source-to-target Gap for Cross-domain Person Re-Identification with Intermediate Domains
Cross-domain person re-identification (re-ID), such as unsupervised domain adaptive (UDA) re-ID, aims to transfer the identity-discriminative knowledge from the source to the target domain. Existing methods commonly cons…
Domain GeneralizationPerson Re-IdentificationTransfer LearningDomain-Scalable Unpaired Image Translation via Latent Space Anchoring
Unpaired image-to-image translation (UNIT) aims to map images between two visual domains without paired training data. However, given a UNIT model trained on certain domains, it is difficult for current methods to incorp…
Image-to-Image TranslationTranslation