Optimal queue to minimize waste

Lei, X. (2023) Optimal queue to minimize waste. Mathematical Social Sciences, 123, pp. 87-94. (doi: 10.1016/j.mathsocsci.2023.03.001)

Abstract

We study an application of stochastic games in the dynamic allocation of two types of goods when agents have deferral rights. If all individuals strictly prefer one good to the other, the worse good can be wasted by successive rejections. We allow different goods to be allocated in different ways and study the combinations of three popular disciplines in an overloaded waiting list: FCFS (first-come-first-serve), LCFS(last-come-first-serve) and RP(random-priority). The first result is that the LCFS-FCFS queue (the better good allocated under LCFS and the worse good allocated under FCFS) does result in zero waste, but it is unfair. To restore fairness, the agent’s age matters and the older agent has a weakly higher probability of receiving goods. Our second result is that RP-FCFS is fair and induces less expected waste than FCFS when the waiting cost is uniformly distributed.

• Item Type: Articles
• Status: Published
• Refereed: Yes
• Glasgow Author(s) Enlighten ID: Lei, Mr Xiaochang
• Authors: Lei, X.
• College/School: College of Social Sciences > Adam Smith Business School > Management
• Journal Name: Mathematical Social Sciences
• Publisher: Elsevier
• ISSN: 0165-4896
• ISSN (Online): 1879-3118
• Published Online: 11 March 2023
• Copyright Holders: Copyright © 2023 The Author
• First Published: First published in Mathematical Social Sciences 123: 87-94
• Publisher Policy: Reproduced under a Creative Commons License