Population monotonicity and consistency in convex games: Some logical relations

On the domain of convex games, many desirable properties of solutions are compatible and there are many single-valued solutions that are intuitively appealing. We establish some interesting logical relations among properties of single-valued solutions. In particular, we introduce a new property, weak contribution-monotonicity, and show that this property is a key property that links other properties such as population-monotonicity, max consistency, converse max consistency, and dummy-player-out.