Assignment games with population monotonic allocation schemes

Abstract

We characterize the assignment games which admit a population monotonic allocation scheme (PMAS) in terms of efficiently verifiable structural properties of the nonnegative matrix that induces the game. We prove that an assignment game is PMAS-admissible if and only if the positive elements of the underlying nonnegative matrix form orthogonal submatrices of three special types. In game theoretic terms it means that an assignment game is PMAS-admissible if and only if it contains either a veto player or a dominant veto mixed pair, or the game is a composition of these two types of special assignment games. We also show that in PMAS-admissible assignment games all core allocations can be extended to a PMAS, and the nucleolus coincides with the tau-value.