IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v13y2025i2p246-d1566003.html
   My bibliography  Save this article

On Priority in Multi-Issue Bankruptcy Problems with Crossed Claims

Author

Listed:
  • Rick Acosta-Vega

    (Facultad de Ingeniería, Universidad del Magdalena, Santa Marta 470004, Colombia)

  • Encarnación Algaba

    (Department of Applied Mathematics II and IMUS, University of Seville, 41092 Seville, Spain)

  • Joaquín Sánchez-Soriano

    (Center of Operations Research (CIO), Miguel Hernández University of Elche, 03202 Elche, Spain)

Abstract

In this paper, we analyze the problem of how to adapt the concept of priority to situations where several perfectly divisible resources have to be allocated among a certain set of agents that have exactly one claim that is used for all resources. In particular, we introduce constrained sequential priority rules and two constrained random arrival rules which extend the classical sequential priority rules and the random arrival rule to these situations. We also provide an axiomatic analysis of these rules. Finally, we present a numerical example to compare the constrained random arrival rule to other solutions in this context.

Suggested Citation

  • Rick Acosta-Vega & Encarnación Algaba & Joaquín Sánchez-Soriano, 2025. "On Priority in Multi-Issue Bankruptcy Problems with Crossed Claims," Mathematics, MDPI, vol. 13(2), pages 1-18, January.
    • Handle: RePEc:gam:jmathe:v:13:y:2025:i:2:p:246-:d:1566003
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/13/2/246/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/13/2/246/
    Download Restriction: no
    ---><---

    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:gam:jmathe:v:13:y:2025:i:2:p:246-:d:1566003. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    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.