Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
110 tokens/sec
GPT-4o
56 tokens/sec
Gemini 2.5 Pro Pro
44 tokens/sec
o3 Pro
6 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
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.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (3)
  1. Lars Lien Ankile (5 papers)
  2. Kjartan Krange (4 papers)
  3. Yuto Yagi (1 paper)

Summary

We haven't generated a summary for this paper yet.