Please use this identifier to cite or link to this item: https://hdl.handle.net/10419/320295 
Year of Publication: 
2025
Citation: 
[Journal:] Theoretical Economics [ISSN:] 1555-7561 [Volume:] 20 [Issue:] 2 [Year:] 2025 [Pages:] 623-665
Publisher: 
The Econometric Society, New Haven, CT
Abstract: 
I study the efficient design of a queue to dynamically allocate a scarce resource to long-lived agents. Agents can be served multiple times, and their valuations fluctuate over time with some persistence. Each agent privately learns whether his prevailing valuation is high or low only when served. An agent can decide anytime whether to either join a queue of his choice or renege. I show that it is efficient to elicit agents' private information by offering a simple binary menu (i.e., two customer classes): a first-come, first-served queue, to attract low-value agents, and one in random order, to attract high-value agents. When queueing is costly, offering a single queue may be optimal because of the tradeoff between allocative efficiency and the cost of screening.
Subjects: 
Queues
experimentation
reneging
congestion
mechanism design
JEL: 
C73
D47
D82
Persistent Identifier of the first edition: 
Creative Commons License: 
cc-by-nc Logo
Document Type: 
Article

Files in This Item:
File
Size





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.