Papers › Approximate Strategyproofness in Large, Two-Sided Matching Markets
Approximate Strategyproofness in Large, Two-Sided Matching Markets
Lars Lien Ankile, Kjartan Krange, Yuto Yagi
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
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.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections