IDEAS home Printed from https://ideas.repec.org/p/hal/pseptp/halshs-03968341.html
   My bibliography  Save this paper

Dynamic Assignment of Objects to Queuing Agents

Author

Listed:
  • Francis Bloch

    (PSE - Paris School of Economics - UP1 - Université Paris 1 Panthéon-Sorbonne - ENS-PSL - École normale supérieure - Paris - PSL - Université Paris Sciences et Lettres - EHESS - École des hautes études en sciences sociales - ENPC - École des Ponts ParisTech - CNRS - Centre National de la Recherche Scientifique - INRAE - Institut National de Recherche pour l’Agriculture, l’Alimentation et l’Environnement, PJSE - Paris Jourdan Sciences Economiques - UP1 - Université Paris 1 Panthéon-Sorbonne - ENS-PSL - École normale supérieure - Paris - PSL - Université Paris Sciences et Lettres - EHESS - École des hautes études en sciences sociales - ENPC - École des Ponts ParisTech - CNRS - Centre National de la Recherche Scientifique - INRAE - Institut National de Recherche pour l’Agriculture, l’Alimentation et l’Environnement)

  • David Cantala

Abstract

We analyze the dynamic assignment of objects to agents organized in a constant size waiting list. Applications include the assignment of social housing and organs for transplants. We analyze the optimal design of probabilistic queuing disciplines, punishment schemes, and information release. With private values, all agents prefer first-come first-served to the lottery, but waste is lower at the lottery. With common values, all agents prefer first-come first-served to any other mechanism, and waste is minimized at the lottery. Punishment schemes accelerate turnover in the queue and information release increases the value of agents at the top of the waiting list.

Suggested Citation

  • Francis Bloch & David Cantala, 2017. "Dynamic Assignment of Objects to Queuing Agents," PSE-Ecole d'économie de Paris (Postprint) halshs-03968341, HAL.
    • Handle: RePEc:hal:pseptp:halshs-03968341
    DOI: 10.1257/mic.20150183
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Schummer, James, 2021. "Influencing waiting lists," Journal of Economic Theory, Elsevier, vol. 195(C).
    2. Itai Ashlagi & Alvin E. Roth, 2021. "Kidney Exchange: An Operations Perspective," Management Science, INFORMS, vol. 67(9), pages 5455-5478, September.
    3. Baccara, Mariagiovanna & Lee, SangMok & Yariv, Leeat, 2023. "Task allocation and on-the-job training," Journal of Economic Theory, Elsevier, vol. 207(C).
    4. Lei, Xiaochang, 2023. "Optimal queue to minimize waste," Mathematical Social Sciences, Elsevier, vol. 123(C), pages 87-94.

    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:hal:pseptp:halshs-03968341. 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: Caroline Bauer (email available below). General contact details of provider: https://hal.archives-ouvertes.fr/ .

    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.