IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2210.17373.html
   My bibliography  Save this paper

Assignment games with population monotonic allocation schemes

Author

Listed:
  • Tam'as Solymosi

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.

Suggested Citation

  • Tam'as Solymosi, 2022. "Assignment games with population monotonic allocation schemes," Papers 2210.17373, arXiv.org.
    • Handle: RePEc:arx:papers:2210.17373
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/2210.17373
    File Function: Latest version
    Download Restriction: no
    ---><---

    Other versions of this item:

    References listed on IDEAS

    as
    1. Norde, Henk & Reijnierse, Hans, 2002. "A dual description of the class of games with a population monotonic allocation scheme," Games and Economic Behavior, Elsevier, vol. 41(2), pages 322-343, November.
    2. Norde, Henk & Moretti, Stefano & Tijs, Stef, 2004. "Minimum cost spanning tree games and population monotonic allocation schemes," European Journal of Operational Research, Elsevier, vol. 154(1), pages 84-97, April.
    3. Solymosi, Tamas & Raghavan, Tirukkannamangai E S, 1994. "An Algorithm for Finding the Nucleolus of Asignment Games," International Journal of Game Theory, Springer;Game Theory Society, vol. 23(2), pages 119-143.
    4. Saadia El Obadi & Silvia Miquel, 2019. "Assignment Games with a Central Player," Group Decision and Negotiation, Springer, vol. 28(6), pages 1129-1148, December.
    5. T. E. S. Raghavan & Tamás Solymosi, 2001. "Assignment games with stable core," International Journal of Game Theory, Springer;Game Theory Society, vol. 30(2), pages 177-185.
    6. Sprumont, Yves, 1990. "Population monotonic allocation schemes for cooperative games with transferable utility," Games and Economic Behavior, Elsevier, vol. 2(4), pages 378-394, December.
    7. Stefano Moretti & Henk Norde, 2021. "A note on weighted multi-glove games," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 57(4), pages 721-732, November.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Stefano Moretti & Henk Norde, 2022. "Some new results on generalized additive games," International Journal of Game Theory, Springer;Game Theory Society, vol. 51(1), pages 87-118, March.
    2. Peter Borm & Herbert Hamers & Ruud Hendrickx, 2001. "Operations research games: A survey," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 9(2), pages 139-199, December.
    3. Han Xiao & Qizhi Fang, 2022. "Population monotonicity in matching games," Journal of Combinatorial Optimization, Springer, vol. 43(4), pages 699-709, May.
    4. Norde, H.W., 2013. "The Degree and Cost Adjusted Folk Solution for Minimum Cost Spanning Tree Games," Discussion Paper 2013-039, Tilburg University, Center for Economic Research.
    5. Stefano Moretti & Henk Norde & Kim Pham Do & Stef Tijs, 2002. "Connection problems in mountains and monotonic allocation schemes," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 10(1), pages 83-99, June.
    6. Moulin, Hervé, 2014. "Pricing traffic in a spanning network," Games and Economic Behavior, Elsevier, vol. 86(C), pages 475-490.
    7. Tijs, S.H. & Brânzei, R. & Moretti, S. & Norde, H.W., 2004. "Obligation Rules for Minimum Cost Spanning Tree Situations and their Monotonicity Properties," Other publications TiSEM 78d24994-1074-4329-b911-c, Tilburg University, School of Economics and Management.
    8. Dietzenbacher, Bas & Dogan, Emre, 2024. "Population monotonicity and egalitarianism," Research Memorandum 007, Maastricht University, Graduate School of Business and Economics (GSBE).
    9. Slikker, Marco & Norde, Henk, 2011. "The monoclus of a coalitional game," Games and Economic Behavior, Elsevier, vol. 71(2), pages 420-435, March.
    10. Marina Núñez & Carles Rafels, 2006. "A Canonical Representation for the Assignment Game: the Kernel and the Nucleolus," Working Papers 279, Barcelona School of Economics.
    11. Barış Çiftçi & Peter Borm & Herbert Hamers, 2010. "Population monotonic path schemes for simple games," Theory and Decision, Springer, vol. 69(2), pages 205-218, August.
    12. Frank Karsten & Marco Slikker & Geert-Jan van Houtum, 2015. "Resource Pooling and Cost Allocation Among Independent Service Providers," Operations Research, INFORMS, vol. 63(2), pages 476-488, April.
    13. S. Miquel & M. Núñez, 2011. "The maximum and the addition of assignment games," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 19(1), pages 189-212, July.
    14. R. Branzei & E. Gutiérrez & N. Llorca & J. Sánchez-Soriano, 2021. "Does it make sense to analyse a two-sided market as a multi-choice game?," Annals of Operations Research, Springer, vol. 301(1), pages 17-40, June.
    15. Jesus Getan & Jesus Montes, 2008. "A characterization of cooperative TU-games with large monotonic core," Working Papers in Economics 193, Universitat de Barcelona. Espai de Recerca en Economia.
    16. Tijs, S.H. & Moretti, S. & Brânzei, R. & Norde, H.W., 2005. "The Bird Core for Minimum Cost Spanning Tree problems Revisited : Monotonicity and Additivity Aspects," Discussion Paper 2005-3, Tilburg University, Center for Economic Research.
    17. Miquel, S. & van Velzen, S. & Hamers, H.J.M. & Norde, H.W., 2005. "Assignment Situations with Multiple Ownership and their Games," Discussion Paper 2005-78, Tilburg University, Center for Economic Research.
    18. Tijs, Stef & Branzei, Rodica & Moretti, Stefano & Norde, Henk, 2006. "Obligation rules for minimum cost spanning tree situations and their monotonicity properties," European Journal of Operational Research, Elsevier, vol. 175(1), pages 121-134, November.
    19. Slikker, M. & Norde, H.W., 2008. "The Monoclus of a Coalitional Game," Other publications TiSEM 8b2bae34-674a-4632-a64e-9, Tilburg University, School of Economics and Management.
    20. Josep M. Izquierdo & Jesús Montes & Carlos Rafels, 2024. "Population Lorenz-monotonic allocation schemes for TU-games," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 63(2), pages 417-436, September.

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:arx:papers:2210.17373. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.