The pairwise egalitarian solution for the assignment game

The pairwise egalitarian solution for the assignment game

0.00 Avg rating0 Votes
Article ID: iaor20121920
Volume: 40
Issue: 2
Start Page Number: 84
End Page Number: 88
Publication Date: Mar 2012
Journal: Operations Research Letters
Authors:
Keywords: combinatorial optimization, programming: linear
Abstract:

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 equ1‐dominant diagonal assignment games ( k = 1 ) equ2, analyzing for which values of k equ3 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.

Reviews

Required fields are marked *. Your email address will not be published.