Assignment games with population monotonic allocation schemes

Tamás Solymosi

Papers from arXiv.org

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

Date: 2022-10
New Economics Papers: this item is included in nep-des and nep-gth
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://arxiv.org/pdf/2210.17373 Latest version (application/pdf)

Related works:
Journal Article: Assignment games with population monotonic allocation schemes (2024)
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:arx:papers:2210.17373

Access Statistics for this paper

More papers in Papers from arXiv.org
Bibliographic data for series maintained by arXiv administrators ().