Axiomatization of the core of assignment games

The core of assignment games is characterized by two different lists of axioms. The first list consists of Pareto optimality, consistency, pairwise monotonicity, and individual monotonicity. The second list is obtained from the first one replacing the last axiom by population monotonicity. As a corollary, individual monotonicity and population monotonicity are equivalent under the other axioms. The core is also characterized by the second list on the restricted domain in which the worth of each pair is non-negative and every reservation value is zero.