Assignment games with population monotonic allocation schemes

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 u...

Full description

Saved in:
Bibliographic Details
Published inarXiv.org
Main Author Solymosi, Tamás
Format Paper
LanguageEnglish
Published Ithaca Cornell University Library, arXiv.org 31.10.2022
Subjects
Allocations
Online AccessGet full text

Cover

More Information
Summary: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 a veto player or a dominant veto mixed pair or is composed of from these two types of special assignment games. We also show that in a PMAS-admissible assignment game all core allocations can be extended to a PMAS, and the nucleolus coincides with the tau-value.
ISSN:2331-8422