Matchings under Preferences: Strength of Stability and Trade-offs

Proceedings of the 2019 ACM Conference on Economics and Computation, pp. 41-59, 2019.

Cited by: 5|Views49
EI

Abstract:

We propose two solution concepts for matchings under preferences: robustness and near stability. The former strengthens while the latter relaxes the classic definition of stability by Gale and Shapley (1962). Informally speaking, robustness requires that a matching must be stable in the classic sense, even if the agents slightly change th...More

Code:

Data:

Your rating :
0

 

Tags
Comments