The pairwise egalitarian solution for the assignment game

In this note we consider the pairwise egalitarian solution (Sánchez-Soriano, 2003) on the domain of assignment games and study its relation with the core. Strengthening the dominant diagonal condition (Solymosi and Raghavan, 2001), we introduce k-dominant diagonal assignment games (k≥1), analyzing for which values of k the pairwise egalitarian solution fulfills the standards of fairness represented by the Lorenz domination and the kernel. We also characterize the Thompson’s fair division point (Thompson, 1981) for arbitrary assignment games.