We analyze stability and (obviously) strategy-proofness in two well-known models of matching theory, namely “assignment problem” (a one-sided matching model) and “marriage problem” (a two-sided matching model). • In ...