Approximate Strategy-Proofness in Large, Two-Sided Matching Markets

12/10/2019

∙

by   Lars Lien Ankile, et al.

∙

0

∙

share

An approximation of strategy-proofness in large, two-sided matching markets is highly evident. Through simulations, one can observe that the percentage of agents with useful deviations decreases as the market size grows. Furthermore, there seems to be a strong connection between the length of preference order lists, the correlation of agent preferences, and the approximation of strategy proofness. Interestingly, approximate strategy proofness is reached easier with shorter length of preference orders and higher preference correlation. These findings justify the use of the deferred acceptance algorithm in large two-sided matching markets despite it not being strategy-proof.