2000 character limit reached
Approximate Strategyproofness in Large, Two-Sided Matching Markets (1912.04800v2)
Published 10 Dec 2019 in cs.MA
Abstract: An approximation of strategyproofness 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 strategyproofness. Interestingly, approximate strategyproofness is reached easier with a 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.
- Lars Lien Ankile (5 papers)
- Kjartan Krange (4 papers)
- Yuto Yagi (1 paper)