We propose a way to compare the extent of preference misrepresentation between two strategies. We define a preference revelation mechanism to be monotone strategyproof if declaring a “more truthful” preference ordering dominates (with respect to the true preferences) declaring a “less...

In this paper we address the question of learning in a two-sided matching mechanism that utilizes the deferred acceptance algorithm. We consider a repeated matching game where at each period agents observe their match and have the opportunity to revise their strategy (i.e., the preference list...