Centralized vs. Decentralized Ambulance Diversion: A Network Perspective
One of the most important operational challenges faced by emergency departments (EDs) in the United States is patient overcrowding. In periods of overcrowding, an ED can request the emergency medical services (EMS) agency to divert incoming ambulances to neighboring hospitals, a phenomenon known as "ambulance diversion." The EMS agency may accept this request provided that at least one of the neighboring EDs is not on diversion. From an operations perspective, properly executed ambulance diversion should result in resource pooling and reduce the overcrowding and delays in a network of EDs. Recent evidence indicates, however, that this potential benefit is not always realized. In this paper, we provide one potential explanation for this discrepancy and suggest potential remedies. Using a queueing game between two EDs that aim to minimize their own waiting time, we find that decentralized decisions regarding diversion explain the lack of pooling benefits. Specifically, we find the existence of a defensive equilibrium, wherein each ED does not accept diverted ambulances from the other ED. This defensiveness results in a depooling of the network and, subsequently, in delays that are significantly higher than when a social planner coordinates diversion. The social optimum is itself difficult to characterize analytically and has limited practical appeal because it depends on problem parameters such as arrival rates and length of stay. Instead, we identify an alternative solution that does not require the exact knowledge of the parameters and may be used by the EMS agencies to coordinate diversion decisions when defensive diversion is present. We show that this solution is approximately optimal for the social planner's problem. Moreover, it is Pareto improving over the defensive equilibrium whereas the social optimum, in general, might not be. This paper was accepted by Yossi Aviv, operations management.
Volume (Year): 57 (2011)
Issue (Month): 7 (July)
|Contact details of provider:|| Postal: 7240 Parkway Drive, Suite 300, Hanover, MD 21076 USA|
Web page: http://www.informs.org/
More information through EDIRC
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Naor, P, 1969. "The Regulation of Queue Size by Levying Tolls," Econometrica, Econometric Society, vol. 37(1), pages 15-24, January.
- Gérard P. Cachon & Fuqiang Zhang, 2007. "Obtaining Fast Service in a Queueing System via Performance-Based Allocation of Demand," Management Science, INFORMS, vol. 53(3), pages 408-420, March.
- Benjaafar, Saifallah, 1995. "Performance bounds for the effectiveness of pooling in multi-processing systems," European Journal of Operational Research, Elsevier, vol. 87(2), pages 375-388, December.
- Ehud Kalai & Morton I. Kamien & Michael Rubinovitch, 1992. "Optimal Service Speeds in a Competitive Environment," Management Science, INFORMS, vol. 38(8), pages 1154-1163, August.
- Baron David & Kalai Ehud, 1993. "The Simplest Equilibrium of a Majority-Rule Division Game," Journal of Economic Theory, Elsevier, vol. 61(2), pages 290-301, December.
- Xavier Vives, 2001. "Oligopoly Pricing: Old Ideas and New Tools," MIT Press Books, The MIT Press, edition 1, volume 1, number 026272040x.
- Levhari, David & Luski, Israel, 1978. "Duopoly pricing and waiting lines," European Economic Review, Elsevier, vol. 11(1), pages 17-35, February.
- Gérard P. Cachon & Patrick T. Harker, 2002. "Competition and Outsourcing with Scale Economies," Management Science, INFORMS, vol. 48(10), pages 1314-1333, October.
When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:57:y:2011:i:7:p:1300-1319. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc)
If references are entirely missing, you can add them using this form.