Can Yardstick Competition Reduce Waiting Times?

Abstract

Yardstick competition is a regulatory scheme for local monopolists (e.g., hospitals), where the monopolist’s reimbursement is linked to performance relative to other equivalent monopolists. This regulatory scheme is known to provide cost-reduction incentives and serves as the theoretical underpinning behind the hospital prospective reimbursement system used throughout the developed world. This paper uses a game-theoretic queueing model to investigate how yardstick competition performs in service systems (e.g., hospital emergency departments), where in addition to incentivizing cost reduction the regulator wants to incentivize waiting time reduction. We first show that the form of cost-based yardstick competition used in practice results in inefficiently long waiting times. We then demonstrate how yardstick competition can be appropriately modified to achieve the dual goal of cost and waiting-time reduction. In particular, we show that full efficiency (first-best) can be restored if the regulator makes the providers’ reimbursement contingent on their service rates and is also able to charge a provider-specific “toll” to consumers. More important, if such a toll is not feasible, as may be the case in healthcare, we show that there exists an alternative and particularly simple yardstick-competition scheme, which depends on the average waiting time only, that can significantly improve system efficiency (second-best). This scheme is easier to implement because it does not require the regulator to have detailed knowledge of the queueing discipline. We conclude with a numerical investigation that provides insights on the practical implementation of yardstick competition for hospital emergency departments, and we also present a series of modelling extensions. The e-companion is available at https://doi.org/10.1287/mnsc.2018.3089 . This paper was accepted by Serguei Netessine, operations management.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 67 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.