Incentive Compatibility of Large Centralized Matching Markets
نویسندگان
چکیده
We study the manipulability of stable matching mechanisms. To quantify incentives to manipulate stable mechanisms, we consider markets with random cardinal utilities, which induce ordinal preferences over match partners. We show that most agents in large matching markets are close to being indifferent overall stable matchings. In oneto-one matching, the utility gain by manipulating a stable mechanism does not exceed the gap between utilities from the best and worst stable partners. Thus, most agents in a large market would not have significant incentives to manipulate stable mechanisms. The incentive compatibility extends to many-to-one matching when agents employ truncation strategies and capacity manipulations in a Gale-Shapley mechanism.
منابع مشابه
The blocking lemma and group incentive compatibility for matching with contracts
This paper considers a general class of two-sided many-to-one matching markets, so-called matching markets with contracts. We study the blocking lemma and group incentive compatibility for this class of matching markets. We first show that the blocking lemma for matching with contracts holds if hospitals’ choice functions satisfy substitutes and the law of aggregate demand. The blocking lemma f...
متن کاملSupplementary Appendix to “Incentive Compatibility of Large Centralized Matching Markets”
First, we summarize definitions and related theorems of asymptotic statistics in Section A. We prove Theorems in Section B. Lastly, Section C contains additional simulation results. A Asymptotic Statistics We summarize some results of asymptotic statistics from (Serfling, 1980). Let X1, X2, . . . and X be random variables on a probability space (Ω,A, P ). We say that Xn converges in probability...
متن کاملCentralized Clustering Method To Increase Accuracy In Ontology Matching Systems
Ontology is the main infrastructure of the Semantic Web which provides facilities for integration, searching and sharing of information on the web. Development of ontologies as the basis of semantic web and their heterogeneities have led to the existence of ontology matching. By emerging large-scale ontologies in real domain, the ontology matching systems faced with some problem like memory con...
متن کاملLocal Supermodularity and Unique Assortative Matching∗
Likes tend to match with likes. Supermodularity or increasing differences is a sufficient condition for unique assortative matching. This paper derives a necessary and sufficient condition, Local Supermodularity, which is satisfied for a broad class of economies. Establishing conditions for uniqueness is desirable for the purpose of incentive compatibility in the design of markets, and it guara...
متن کاملPolyhedral Clinching Auctions for Two-sided Markets
In this paper, we present a new model and mechanism for auctions in two-sided markets of buyers and sellers, with budget constraints imposed on buyers. Our mechanism is viewed as a two-sided extension of the polyhedral clinching auction by Goel et al., and enjoys various nice properties, such as incentive compatibility of buyers, individual rationality, pareto optimality, strong budget balance....
متن کامل