IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v70y2022i5p2804-2819.html
   My bibliography  Save this article

Allocation with Weak Priorities and General Constraints

Author

Listed:
  • Young-San Lin

    (Department of Computer Science, Purdue University, West Lafayette, Indiana 47906)

  • Hai Nguyen

    (Department of Computer Science, Purdue University, West Lafayette, Indiana 47906)

  • Thành Nguyen

    (Krannert School of Management, Purdue University, West Lafayette, Indiana 47906)

  • Kemal Altinkemer

    (Krannert School of Management, Purdue University, West Lafayette, Indiana 47906)

Abstract

We consider a resource allocation problem that combines three general features: complex resource constraints, weak priority rankings over the agents, and ordinal preferences over bundles of resources. We develop a mechanism based on a new concept called competitive stable equilibrium . It has several attractive properties, commonly captures two different frameworks of one-sided and two-sided markets, and extends them to richer environments. Our framework also allows for an alternative and more flexible tie-breaking rule by giving agents different budgets. We empirically apply our mechanism to reassign season tickets to families in the presence of social distancing. Our simulation results show that our method outperforms existing ones in both efficiency and fairness measures.

Suggested Citation

  • Young-San Lin & Hai Nguyen & Thành Nguyen & Kemal Altinkemer, 2022. "Allocation with Weak Priorities and General Constraints," Operations Research, INFORMS, vol. 70(5), pages 2804-2819, September.
    • Handle: RePEc:inm:oropre:v:70:y:2022:i:5:p:2804-2819
    DOI: 10.1287/opre.2022.2329
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.2022.2329
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.2022.2329?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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:inm:oropre:v:70:y:2022:i:5:p:2804-2819. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.