Stability, efficiency and monotonicity in two-sided matching

we propose a fairness property called P-monotonicity that we would like a matching mechanism to satisfy. We show that it is impossible to have a mechanism which is both stable and P- monotonic. Moreover, we show that it is impossible to have a mechanism which is both efficient and P-monotonic